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

3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09

作者： Luo, Xiangfeng Du, Yi Liu, Fangfang Yu, Zhian Xu, Weimin Digital Content Computing and Semantic Grid Group Joint Lab. of Next-Generation Internet Interactive Computing Shanghai University 200072 China

ISBN: (纸本)9781605584058

Importance degree and difference degree of keywords in different topics have been computed by the weights in Element Fuzzy Cognitive Maps (E-FCMs). Logic "and" operation is introduced to roughly evaluate the similarities between mass E-FCMs in order to form similar communities of E-FCMs. Based on the weights computing and the logic "and" operation, an E-FCMs-based knowledge merging algorithm is proposed to inspect the noisy and the redundancy information hidden in the original E-FCMs belonging to one similar community. Shannon entropy is employed as an indicator to measure the loss of textual information during the merging process of E-FCMs. The merging algorithm and the indicator provide a concise representation of text knowledge that can be used in understanding-based text automatic classification and clustering, as well as relevant knowledge aggregation and integration. The proposed algorithm has very good application prospects in the fields of e-Science knowledge gird and e-Learning.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Discovery of associated topics for the intelligent browsing

Discovery of associated topics for the intelligent browsing

引用

2008 the 1st IEEE International Conference on Ubi-Media computing and Workshops, U-Media2008

作者： Luo, Xiangfeng Xu, Zheng Yu, Jie Liu, Fangfang Digital Content Analysis and Semantic Grid Group Joint Lab. of Next-Generation Internet Interactive Computing Shanghai University 200072 China

ISBN: (纸本)9781424418657

Intelligent browsing of topics is one of the key issues of the Web and the Knowledge Grid, which provides on-demand services to support knowledge discovery and innovation. In this paper, Background of topics composed by Associated Relations (BAR) between keywords belonging to one domain is developed to extend the topics' associated relations based on the Element Fuzzy Cognitive Maps (E-FCMs), which helps us discover the associated topics that do not have direct associated relation at the keyword level. The Matrix of element Concepts (MC) is presented to store element concepts of topics. Through MC we can obtain the causal concepts of each topic in one domain;logic operation "AND" is given to get associated topics. Semantic Link Network (SLN) is automatically generated by the associated topics, which can realize the intelligent browsing of topics in Web or Knowledge Grid. Experimental results show that the browsing path of topics is easier to be built by the proposed algorithm and the associated topic can be recommended automatically. Meanwhile, an application of the associated topics in multimedia provides a good prospect on the cross media intelligent browsing. © 2008 IEEE.

关键词： Fuzzy Cognitive Maps

来源：评论

学校读者我要写书评

暂无评论

Automatic discovery of semantic relations based on association rule

Journal of Software

引用

Journal of Software 2008年第8期3卷 11-18页

作者： Luo, Xiangfeng Yan, Kai Chen, Xue Joint Lab of Next-Generation Internet Interactive Computing Shanghai University Shanghai China

Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explores how to automatically discover the latent semantic relations and their properties based on the existing association rules. Through building semantic matrix by the association rules, four semantic relations can be extracted using union and intersection in set theory. By building a cyclic graph model, the transitive path of association relation is discovered. Document-level keywords and domain-level keywords as well as their parameters are analyzed to improve the discovery accuracy. Rules can be gained from the experiments to optimize the discovery processes for relations and properties. Further experiments validate the effectiveness and efficiency of the relation discovery algorithms, which can be applied in Web search, intelligent browsing and Web service composition. © 2008 ACADEMY PUBLISHER.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Measuring knowledge delivery quantity of associated knowledge flow

Measuring knowledge delivery quantity of associated knowledg...

引用

4th International Conference on Semantics, Knowledge, and Grid, SKG 2008

作者： Shunxiang, Zhang Xiangfeng, Luo Jinjun, Chen Zheng, Xu Jie, Yu Weimin, Xu Digital Content Computing and Semantic Grid Group Joint Lab of Next-Generation Internet Interactive Computing Shanghai University China 200072 China Swinburne University of Technology Australia Anhui University of Science and Technology China232001 China

ISBN: (纸本)9780769534015

Associated knowledge flow (AKF) is a sequential link between associated topics, which can be applied to intelligent browsing and personalized recommendation. One key problem is how to measure the knowledge delivery quantity (KDQ) on an AKF. In this paper, a computational method of knowledge delivery quantity on an AKF is proposed. Firstly, considering the keywords and associated relations between two nodes, four key factors for knowledge delivery quantity between two nodes are investigated. Secondly, based on the four factors, an algorithm is proposed to calculate the knowledge delivery quantity between two nodes. Thirdly, the knowledge delivery quantity of a node with adjacent nodes is calculated for the measurement of local knowledge delivery on an AKF. Lastly, according to the local knowledge delivery, the average knowledge delivery quantity is proposed to measure an AKF. Experimental results show that the proposed measurement method is accurate and effective. © 2008 IEEE.

关键词： Fluid flow measurement Knowledge management Grid computing Fuzzy cognitive maps internet Computational intelligence Technological innovation Web services Resource management Data models

来源：评论

学校读者我要写书评

暂无评论

Exploiting independence in design of web service composition

Exploiting independence in design of web service composition

引用

IEEE International Conference on Web Services, ICWS 2008

作者： Fangfang, Liu Yan, Chi Xiangfeng, Luo School of Computer Engineering and Science Shanghai University China Shifang Research Shanghai China Digital Content Analysis and Semantic Group Joint Lab. Next-Generation Internet Interactive Computing Shanghai University China

ISBN: (纸本)9780769533100

Communications among web services are asynchronous. Asynchronous models of service compositions face the problem that the performance of verification is bring down with states explosion. We describe an approach, which utilize the interaction-independence of component services in the composition and forms all component services into different groups. Preliminary experiment results show that the verification of service compositions upon these groups can decrease the size of exploration states and hence improve the performance. ©2008 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

generation of Web Knowledge Flow for Personalized Services

Generation of Web Knowledge Flow for Personalized Services

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Jie Yu Xiangfeng Luo Feiyue Ye Yongmei Lei Digital Content Computing and Semantic Grid Group Joint Laboratory of Next-Generation Internet Interactive Computing Shanghai University China

Personalized services provide specific services to satisfy userpsilas real-time requirements. How to effectively discover and organize proper Web resources is a key issue. Based on Web knowledge flow which is used to semantically organize and represent Web resources that are recommended to user, this paper presents a 3-way strategy of finding proper resources for a user in multi-user environment. With this strategy, generation of Web Knowledge flow can be accomplished based on collaborative user and semantics link network. First, according to the similarity degree between active user and collaborative user, collaborative user is refined to strict kind and loose kind. Secondly, userpsilas browsing sequence of Web resources is presented to find collaborative users and implemented in a 3-D coordinate space. Thirdly, average information entropy of semantic relationship between Web resources is presented to evaluate the similarity of userspsila browsing feature. The experimental results demonstrate the validity of the method. It can be seen that the proposed method has a brilliant perspective in the applications of Web personalized services.

关键词： Collaboration Information entropy Filtering Concurrent computing Distributed computing Grid computing Qualifications Ontologies Distributed processing Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Representation and evolution of user profile in web activity

Representation and evolution of user profile in web activity

引用

1st IEEE International Workshop on Semantic computing and Systems, WSCS 2008

作者： Yu, Jie Luo, Xiangfeng Xu, Zheng Liu, Fangfang Li, Xuhui Digital Content Analysis and Semantic Grid Group Joint Lab. of Next-Generation Internet Interactive Computing Shanghai University 200072 China State Key Lab. Of Software Engineering Wuhan University 430072 China

ISBN: (纸本)9780769533162

In the web personalization of web service and construction of adaptive web site, how to represent uses profile is one of the key issues. Aiming at solving the existing problems in representation of user profile includes incapability of effectively representing user's recent interest, lack in dynamically effectively updating. This paper presents a new method of representation of user profile. By computing the interest degree with association degree between topics, updating of interest degree is preformed. By introducing memory model, it can predict which web pages are still concerned by the user. By classifying the operations on the presented user profile, the construction and evolution can be done. In case study a user's browsing activities is traced and corresponding user profile is built and evolves, thus to prove the feasibility of this method. © 2008 IEEE.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

Generating Associated Relation between Documents

Generating Associated Relation between Documents

引用

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Xiangfeng Luo Guoning Liang Shijun Liu Joint Laboratory of Next-Generation Internet Interactive Computing Digital Content Analysis and Semantic Grid Group Shanghai University China

Traditional text mining techniques have weak ability to provide associated relations with rich semantics that is a foundation of the intelligent browsing of topics, discovery of semantic community and precise personalized recommendation in current Web and knowledge Grid, etc. In this paper we propose an algorithm to generate and calculate the associated relations and their strengths between documents within a domain. Each document is represented by a bag of words and their weights. We first build domain knowledge background based on the association rules at keyword level, and then we apply those association rules to generate and calculate the documents' semantic relations and their strengths at document level, which effectively shorten the semantic gap from keyword semantics to document semantics. Experimental results show that our proposed method is feasible and able to discover interesting facts within a domain.

关键词： Association rules Databases Web pages Communities Algorithm design and analysis Knowledge engineering Text mining

来源：评论

学校读者我要写书评

暂无评论

Trust factors in P2P networks

Trust factors in P2P networks

引用

1st IEEE International Workshop on Semantic computing and Systems, WSCS 2008

作者： Chen, Xue Chen, Guisheng Liu, Jin Luo, Xiangfeng Li, Xuhui Li, Bing Digital Content Computing and Semantic Grid Group Joint Lab. of Next-Generation Internet Interactive Computing Shanghai University 200072 China State Key Lab. of Software Engineering Wuhan University 430072 China Institute of Electronic System and Engineering of China Beijing 100039 China

ISBN: (纸本)9780769533162

P2P networks have become a popular way to share large volumes of data due to its open and anonymous nature. P2P network model is designed with the targets of decentralization, well-scaling, fault-tolerance and low cost. Meanwhile however, new targets bring new challenges. P2P network expose more security threats due to its open and anonymous nature. P2P networks are vulnerable to attacks by malicious peers that have an incentive to spread viruses, inauthentic data, or provide poor quality services. In this paper, we analyze the potential trust problems for different kinds of P2P networks, and then present the general trust factors that are indispensable for building trust models in any kinds of networks. © 2008 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Discovery of associated topics for the intelligent browsing

Discovery of associated topics for the intelligent browsing

引用

IEEE International Conference on Ubi-Media computing

作者： Xiangfeng Luo Zheng Xu Jie Yu Fangfang Liu Digital Content Analysis and Semantic Grid Group Joint Lab of Next-Generation Internet Interactive Computing Shanghai University China

ISBN: (纸本)9781424418657

Intelligent browsing of topics is one of the key issues of the Web and the knowledge grid, which provides on-demand services to support knowledge discovery and innovation. In this paper, Background of topics composed by Associated Relations (BAR) between keywords belonging to one domain is developed to extend the topicspsila associated relations based on the element fuzzy cognitive maps (E-FCMs), which helps us discover the associated topics that do not have direct associated relation at the keyword level. The matrix of element concepts (MC) is presented to store element concepts of topics. Through MC we can obtain the causal concepts of each topic in one domain; logic operation ldquoANDrdquo is given to get associated topics. Semantic Link Network (SLN) is automatically generated by the associated topics, which can realize the intelligent browsing of topics in Web or knowledge grid. Experimental results show that the browsing path of topics is easier to be built by the proposed algorithm and the associated topic can be recommended automatically. Meanwhile, an application of the associated topics in multimedia provides a good prospect on the cross media intelligent browsing.

关键词： Fuzzy cognitive maps Data mining Technological innovation Intelligent networks Association rules Web and internet services Grid computing Logic Mesh generation Uniform resource locators

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：