Ranking is a main research issue in IR-styled keyword search over a set of documents. In this paper, we study a new keyword search problem, called context-sensitive document ranking, which is to rank documents with an...Ranking is a main research issue in IR-styled keyword search over a set of documents. In this paper, we study a new keyword search problem, called context-sensitive document ranking, which is to rank documents with an additional context that provides additional information about the application domain where the documents are to be searched and ranked. The work is motivated by the fact that additional information associated with the documents can possibly assist users to find more relevant documents when they are unable to find the needed documents from the documents alone. In this paper, a context is a multi-attribute graph, which can represent any information maintained in a relational database, where multi-attribute nodes represent tuples, and edges represent primary key and foreign key references among nodes. The context-sensitive ranking is related to several research issues, how to score documents, how to evaluate the additional information obtained in the context that may contribute to the document ranking, how to rank the documents by combining the scores/costs from the documents and the context. More importantly, the relationships between documents and the information stored in a relational database may be uncertain, because they are from different data sources and the relationships are determined systematically using similarity match which causes uncertainty. In this paper, we concentrate ourselves on these research issues, and provide our solution on how to rank the documents in a context where there exist uncertainty between the documents and the context. We confirm the effectiveness of our approaches by conducting extensive experimental studies using real datasets. We present our findings in this paper.展开更多
论文以网络拓扑结构概念应用于组织际信息系统(interorganizational information systems,IOS)的管理运作研究上,研究了组织际信息系统结构的拓扑类型,提出结构成本概念,构建了IOS运营成本模型,对不同拓扑结构所对应的运营成本进行量化...论文以网络拓扑结构概念应用于组织际信息系统(interorganizational information systems,IOS)的管理运作研究上,研究了组织际信息系统结构的拓扑类型,提出结构成本概念,构建了IOS运营成本模型,对不同拓扑结构所对应的运营成本进行量化与比较、优化,并进一步基于结构成本的组织际信息系统拓扑结构与产业类型匹配问题展开应用研究。结果表明企业维护其IOS在产业链中具有竞争优势的位置而支付的费用会带来其与产业链其他企业的交易成本减少,同样的企业为了追求更具优势的IOS结构位置而支付的费用也会带来企业的交易成本减少。论文的贡献:一方面,结构成本概念引入IOS拓扑结构时可分析IOS各拓扑结构的成本优势,对企业加入或构建何种结构形式的IOS具有重要指导意义,进而扩展到产业上的应用;另一方面,对组织际信息系统的理论依据做出一定的调整,扩充了现有理论体系。展开更多
基金supported by the Research Grants Council of the Hong Kong SAR,China,under Grant Nos. 419008 and 419109
文摘Ranking is a main research issue in IR-styled keyword search over a set of documents. In this paper, we study a new keyword search problem, called context-sensitive document ranking, which is to rank documents with an additional context that provides additional information about the application domain where the documents are to be searched and ranked. The work is motivated by the fact that additional information associated with the documents can possibly assist users to find more relevant documents when they are unable to find the needed documents from the documents alone. In this paper, a context is a multi-attribute graph, which can represent any information maintained in a relational database, where multi-attribute nodes represent tuples, and edges represent primary key and foreign key references among nodes. The context-sensitive ranking is related to several research issues, how to score documents, how to evaluate the additional information obtained in the context that may contribute to the document ranking, how to rank the documents by combining the scores/costs from the documents and the context. More importantly, the relationships between documents and the information stored in a relational database may be uncertain, because they are from different data sources and the relationships are determined systematically using similarity match which causes uncertainty. In this paper, we concentrate ourselves on these research issues, and provide our solution on how to rank the documents in a context where there exist uncertainty between the documents and the context. We confirm the effectiveness of our approaches by conducting extensive experimental studies using real datasets. We present our findings in this paper.
文摘论文以网络拓扑结构概念应用于组织际信息系统(interorganizational information systems,IOS)的管理运作研究上,研究了组织际信息系统结构的拓扑类型,提出结构成本概念,构建了IOS运营成本模型,对不同拓扑结构所对应的运营成本进行量化与比较、优化,并进一步基于结构成本的组织际信息系统拓扑结构与产业类型匹配问题展开应用研究。结果表明企业维护其IOS在产业链中具有竞争优势的位置而支付的费用会带来其与产业链其他企业的交易成本减少,同样的企业为了追求更具优势的IOS结构位置而支付的费用也会带来企业的交易成本减少。论文的贡献:一方面,结构成本概念引入IOS拓扑结构时可分析IOS各拓扑结构的成本优势,对企业加入或构建何种结构形式的IOS具有重要指导意义,进而扩展到产业上的应用;另一方面,对组织际信息系统的理论依据做出一定的调整,扩充了现有理论体系。
