检索结果-内蒙古大学图书馆

2nd International Conference on Management of e-Commerce and e-Government

作者： Lai Xinfeng Wan Changxuan Liu Dexi Jiangxi Univ Finance & Econ Sch Informat Technol Nanchang 330013 Jiangxi Peoples R China JXUFE Jiangxi Key Lab Data & Knowledge Engn Nanchang 330013 Jiangxi Peoples R China

ISBN: (纸本)9780769533667

XML has become an important format for exchange data. Ranking of XML search results directly relates to XML information retrieval performance. Most of the existing ranking models consider words statistical characteristics in the XML document, but they do not consider position of the node a word belongs to. That is to say, all of nodes in XML document have the equal importance. However, different node plays different role in the entire XML document. So, the same content in different node should have different weight. It means different nodes should have different node semantic weight. In this paper, we present a VSM based method for XML node semantic weight (XNSW-VSM), which is scaled by the similarity between the node and the whole document. Experiment data were selected from Wiki data sets. The Pearson correlation coefficient between semantic results given by experts and the model results is 0.827. It shows the node semantic weight model can analyze the importance of node in XML document and it will be helpful for improving ranking results.

关键词： XML Node Node Semantic Weight VSM

来源：评论

学校读者我要写书评

暂无评论

A Novel Storage Architecture of In-Memory databases Supporting Real-time E-commerce Applications

A Novel Storage Architecture of In-Memory Databases Supporti...

引用

2nd International Conference on Management of e-Commerce and e-Government

作者： Deng Kun Liao Guoqiong Huang Yukun Li Jing Xia Jiali Jiangxi Univ Finance & Econ Sch Informat Technol Nanchang 330013 Peoples R China Jiangxi Univ Finance & Econ Jiangxi Key Lab Data & Knowledge Engn Nanchang 330013 Jiangxi Peoples R China Jiangxi Univ Finance & Econ Sch Software Nanchang 330013 Jiangxi Peoples R China

ISBN: (纸本)9780769533667

With growing numbers of suppliers/buyers and the introduction of new additional applications, the simplified and centralized organization of data in the E-commerce systems becomes a focus in reducing operational and capital expenses. With the availability of faster server hardware, network connections and high performance databases, the realization of a common database hosting data for multiple applications becomes technically feasible. However, this kind of deployment will bring new challenges to database systems. One critical challenge is the database should be optimized for real-time accessing databases on large data size. In this report, a novel main memory database architecture based on solid state disks is suggested to meet the requirement. Experiment results shows following benefits can be obtained from the solid state disks: transaction throughput, average response time of write transactions, and database recovery time.

关键词： Memory architecture database data size electronic commerce database systems solid state database recovery Reaction Time solid-state disk disks cultivators deployment database architecture

来源：评论

学校读者我要写书评

暂无评论

Clustering Technology Application in e-Commerce Recommendation System

Clustering Technology Application in e-Commerce Recommendati...

引用

International Conference on Management of e-Commerce and e-Government, ICMECG

作者： Jing Hui Wu Qiang Liu Si Wen Luo Jiangxi key Lab. of Data & Knowledge Eng. Jiangxi Univ. of Finance & Econ. Nanchang

This article analyses two kinds of information filtering technologies used in the e-commerce recommendation system: content-based filtering and collaborative filtering. On the foundation of collaborative filtering, we research the influential role of cluster technology to improve the recommendation system quality, to reduce the computation complexity, and to enhance the system real-time response speed.

关键词： Filtering Collaboration Information filtering Real time systems data mining Business Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Clustering XML retrieval results based on hybrid similarity

引用

Journal of Computational Information Systems 2008年第3期4卷 1323-1330页

作者： Wan, Changxuan Yu, Hong School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 China

With the unceasing growth of XML data in World Wide Web, XML document retrieval and clustering retrieval results are confronted with both challenges and opportunities. One of the challenges is how to improve the quality of XML retrieval results. Firstly, according to the features of XML documents, a method of modeling XML retrieval result documents is brought forward, which integrates both structural semantic features and content information of XML documents. Then, a measure method to compute similarity, including structural semantic similarity and keywords similarity, between retrieval result documents is suggested;and a strategy named Item Frequency in Cluster-Inverse Cluster Frequency to extract labels from result clusters is presented. Experiments indicate that the clustering quality for XML retrieval results based on hybrid similarity is obviously better than the one only based on content similarity.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Structural Join and Staircase Join Algorithms of Sibling Relationship

引用

Journal of Computer Science & Technology 2007年第2期22卷 171-181页

作者：万常选刘喜平 School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

The processing of XML queries can result in evaluation of various structural relationships. Efficient algorithms for evaluating ancestor-descendant and parent-child relationships have been proposed. Whereas the problems of evaluating preceding-sibling-following-sibling and preceding-following relationships are still open. In this paper, we studied the structural join and staircase join for sibling relationship. First, the idea of how to filter out and minimize unnecessary reads of elements using parent＇s structural information is introduced, which can be used to accelerate structural joins of parent-child and preceding-sibling-following-sibling relationships. Second, two efficient structural join algorithms of sibling relationship are proposed. These algorithms lead to optimal join performance： nodes that do not participate in the join can be judged beforehand and then skipped using B^＋-tree index. Besides, each element list joined is scanned sequentially once at most. Furthermore, output of join results is sorted in document order. We also discussed the staircase join algorithm for sibling axes. Studies show that, staircase join for sibling axes is close to the structural join for sibling axes and shares the same characteristic of high efficiency. Our experimental results not only demonstrate the effectiveness of our optimizing techniques for sibling axes, but also validate the efficiency of our algorithms. As far as we know, this is the first work addressing this problem specially.

关键词： XML query processing sibling relationship structural join staircase join

来源：评论

学校读者我要写书评

暂无评论

Minimizing XML queries using a family of constraints

Minimizing XML queries using a family of constraints

引用

4th International Conference on Fuzzy Systems and knowledge Discovery

作者： Liu, Xiping Wan, Changxuan Jiangxi Univ Finance & Econ Sch Informat Technol Jiangxi Key Lab Data & Knowledge Engn Nanchang Peoples R China

ISBN: (纸本)0769528740

An effective way to optimize XML queries is to minimize XML queries. In this paper we improve redundance elimination in XPath queries greatly by incorporating two novel kinds of constraints: parent constraint and sibling constraint, and by extending the tractable fragment to include descendant-or self axis. The two novel kinds of constraints, together with child constraint and descendant constraint, form a family of constraints, which complicate the problem but offer possibilities for further minimization. Two techniques, tree augmentation and simulation augmentation, are employed to cope with constraints. We elaborate on the minimizing algorithms and running efficiencies both in the absence and in the presence of various kinds of constraints.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

The Approximation Operators Within Formal Contexts

The Approximation Operators Within Formal Contexts

引用

International Conference on Multimedia and Ubiquitous engineering (MUE)

作者： Ming-Wen Shao Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang Jiangxi China

In this paper, based on concept lattices and dual concept lattices, we introduced a pair of rough set approximation operators within formal contexts. The proposed approximations operators don't require the equival... 详细信息

关键词： Lattices Set theory Finance data analysis Bismuth Information technology laboratories knowledge engineering Artificial intelligence Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Ontology hierarchies matching by lattices alignment

Ontology hierarchies matching by lattices alignment

引用

2nd International Workshop on Ontology Matching, OM-2007 - Collocated with the 6th International Semantic Web Conference, ISWC-2007 and the 2nd Asian Semantic Web Conference, ASWC-2007

作者： He, Hu Du, Xiaoyong School of Information Renmin University of China 100872 Beijing China Key Lab. of Data and Knowledge Engineering MOE 100872 Beijing China

Ontology matching determines the correspondences between concepts and relations of related ontologies. In this paper, we put forward an ontology hierarchies matching approach based on lattices alignment. The proposed lattice-based matching algorithm can be utilized not only in matching processes between two ontologies, but also in annotation processes between an ontology and its corresponding resources. Experiments on spatiotemporal ontology annotation have been carried out which shown the applicability of the approach.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Building bilingual ontology from WordNet and Chinese classified thesaurus

引用

2nd International Conference on knowledge Science, engineering and Management, KSEM 2007

作者： He, Hu Xiaoyong, Du School of Information Renmin University of China 100872 Beijing China Key Lab. of Data and Knowledge Engineering MOE 100872 Beijing China

ISBN: (纸本)9783540767183

Both WordNet and Chinese Classified Thesaurus(CCT) are widely used in information retrieval and management systems. In this paper we propose a novel approach for building bilingual ontologies based on these existing knowledge bases, WordNet and CCT. The bilingual ontology has the merit that contains both domain related and general purpose semantic information coverage from these two complementary knowledge sources. A lattice based similarity measure and assessment algorithm is used for aligning and merging these two knowledge bases. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Two types of generalized variable precision formal concepts

Two types of generalized variable precision formal concepts

引用

International Conference on Rough Sets and Intelligent Systems Paradigms

作者： Yang, Hong-Zhi Shao, Ming-Wen Xi An Jiao Tong Univ Fac Sci Xian 710049 Shaanxi Peoples R China Pingyuan Univ Xinxiang 453003 Henan Peoples R China Jiangxi Univ Finance & Econ Sch Informat Technol Nanchang 330013 Jiangxi Peoples R China Jiangxi Univ Finance & Econ Jiangxi Key Lab Data & Knowledge Engn Nanchang 330013 Jiangxi Peoples R China

ISBN: (纸本)9783540734505

In this paper, we introduce two pairs operators in fuzzy formal contexts. Based on the proposed operators, we present two types of generalized variable precision formal concepts, i.e. property oriented crisp-fuzzy concepts and object oriented fuzzy-crisp concepts. We have different level generalized formal concepts with different precision level. Last, we discuss the relationship between different precision level generalized concepts lattices in details.

关键词： formal concept analysis fuzzy formal context concept lattice variable precision

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：