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

Emergent semantics from folksonomies: A quantitative study

Journal on Data Semantics VI - Special Issue on Emergent Semantics

作者： Zhang, Lei Wu, Xian Yu, Yong APEX Data and Knowledge Management Lab. Department of Computer Science and Engineering Shanghai JiaoTong University Shanghai 200030 China

ISBN: (纸本)3540367128

Defining and using ontology to annotate web resources with semantic markups is generally perceived as the primary way to implement the vision of the Semantic Web. The ontology provides a shared and machine understandable semantics for web resources that agents and applications can utilize. This top-down approach (in the sense that an ontology is defined first on top of existing web resources and then used later to markup them), however, has a high barrier to entry and is difficult to scale up. In this paper, we investigate using a bottom-up approach for semantically annotating web resources as supported by the now widely popular social bookmarks services on the web where users can annotate and categorize web resources using "tags" freely choosen by the user without any pre-existing global semantic model. This kind of informal social categories is coined as "folksonomies". We show how global semantics can be statistically inferred from the folksonomies to semantically annotate the web resources. The global semantic model also disambiguate the tags and group synonymous tags together. Finally, we show that there indeed are hierarchical relations among the emerged concepts in the folksonomy and it is plausible to further identify them if we use more advanced probabilistic models. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Learning Hierarchical User Interest Models from Web Pages

引用

Wuhan University Journal of Natural sciences 2006年第1期11卷 6-10页

作者： YANG Feng-qin SUN Tie-li SUN Ji-gui College of Computer Science and Technology Jilin University Changchun 130012 Jilin China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 120012 Jilin China Department of Computer Science Northeast Normal University Changchun 130024 Jilin China

We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.

关键词： personalization user interest model vector space model agglomerate clustering method

来源：评论

学校读者我要写书评

暂无评论

Mining and predicting duplication over peer-to-peer query streams

Mining and predicting duplication over peer-to-peer query st...

引用

作者： Meng, Shicong Shao, Yifeng Shi, Cong Han, Dingyi Yu, Yong APEX Data and Knowledge Management Lab. Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200030 China

ISBN: (纸本)0769527027

Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models(Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction. © 2006 IEEE.

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Identification of transcription factor binding sites using GA and PSO

Identification of transcription factor binding sites using G...

引用

6th International Conference on Intelligent Systems Design and Applications (ISDA 2006)

作者： Chang, Xiao-Yu Zhou, Chun-Guang Li, Yan-Wen Hu, Ping Key Laboratory of Symbol Computation and J Knowledge Engineering Jilin University Ministry of Education China Department of Computer Science Northeast Normal University Changchun 130012 China

ISBN: (纸本)0769525288

Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: Genetic, Algorithm (GA) and Particle Swarm Optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast Saccharomyces Cerevisiae transcription factor binding sites and CRP binding sites. The results on Saccharomyces Cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs Sampler.

关键词： Binding sites

来源：评论

学校读者我要写书评

暂无评论

Depth-first algorithm of finding all association rules generated by a frequent itemset

引用

Journal of Donghua University (English Edition) 2006年第6期23卷 1-4+9页

作者： Wu, Kun Jiang, Bao-Qing Wei, Qing Institute of Data and Knowledge Engineering Henan University Kaifeng 475001 China Personnel Department Zhengzhou Institute of Aeronautical Industry Management Zhengzhou 450000 China Computer Science Department Henan University of Finance and Economics Zhengzhou 450000 China

The classical algorithm of finding association rules generated by a frequent itemset has to generate all nonempty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed an improved algorithm. The algorithm finds all consequents layer by layer, so it is breadth-first. In this paper, we propose a new algorithm Generate Rules by using Set-Enumeration Tree (GRSET) which uses the structure of Set-Enumeration Tree and depth-first method to find all consequents of the association rules one by one and get all association rules correspond to the consequents. Experiments show GRSET algorithm to be practicable and efficient.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

An ontology-based architecture for tracking information across interactive electronic environments

An ontology-based architecture for tracking information acro...

引用

39th Annual Hawaii International Conference on System sciences, HICSS'06

作者： Scharl, Arno Weichselbraun, Albert Liu, Wei Know-Center Institute of Knowledge Management Graz University of Technology Department of Information Systems and Operations Vienna University of Economics and Business Administration School of Computer Science and Software Engineering University of Western Australia

ISBN: (纸本)0769525075

This paper presents technical foundation, roadmap and initial results of the IDIOM project (Information Diffusion across Interactive Online Media). Information spreads rapidly across Web sites, Web logs and online forums. IDIOM tracks this process and compares it to direct communication through electronic mail and instant messaging. Linguists define "idiom" as an expression whose meaning is different from the literal meanings of its component words. Similarly, the study of information diffusion promises insights that cannot be inferred from individual network elements. Similar projects often focus on particular media, or neglect important aspects of the human language. IDIOM addresses these gaps to reveal fundamental mechanisms of information diffusion across media with distinct interactive characteristics. © 2006 IEEE.

关键词： Electronic equipment

来源：评论

学校读者我要写书评

暂无评论

Cooperative negotiation mechanism for agent based distributed manufacturing scheduling

引用

WSEAS Transactions on Systems 2006年第12期5卷 2899-2904页

作者： Madureira, Ana Gomes, Nuno Santos, Joaquim Computer Science Department Institute of Engineering - Polytechnic of Porto GECAD - Knowledge Engineering and Decision Support Research Group Porto Portugal

We can see Multi-Agent Systems (MAS) like a society of agents that cooperates to work in the best way possible. With this we gain the ability of solve complex problems like dynamic and distributed scheduling. MAS consists of several autonomous entities, called agents, that interact with each other to either further their own interests, trough competition or in pursuit a common objective trough cooperation. Social aspects are considered when a community of autonomous agents cooperate to reach a common goal. Agents negotiate in a cooperative way, in order to find a consistent overall plan, while avoiding significant changes onto their current best possible local plans. In this work we consider that a good global solution for a scheduling problem may emerge from a community of machine agents solving locally their schedules and cooperating with other machine agents. A cooperative negotiation mechanism is proposed for solving the schedules coordination process in the Multi-Agent System for Dynamic Scheduling in Manufacturing with Genetic Algorithms and Tabu Search (MASDScheGATS).

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic ontology integration in a multi-agent environment

Dynamic ontology integration in a multi-agent environment

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： S.M. Deen K. Ponnamperuma Data and Knowledge Engineering DAKE Group Department of Computer Science University of Keele UK

We present here an approach for dynamic ontology integration for a multi-agent environment, in which each agent holds the ontologies of its acquaintances (i.e., other agents of its interest) as the integrated partial global ontology, which is essential to interpret the local schemas for inter-agent operations. This integration has to be carried out whenever a new acquaintance is added or when the local ontology of an acquaintance changes. The approach described is general (i.e., independent of any particular thesaurus) and it carries out the integration automatically except for minimal unavoidable human inputs to resolve semantic conflicts if discovered in the process.

关键词： Ontologies Thesauri Humans Semantic Web Peer to peer computing Multiagent systems knowledge engineering computer science Shape Scalability

来源：评论

学校读者我要写书评

暂无评论

A Framework for the Decentralisation and Management of Collaborative Applications in Ubiquitous Computing Environments

A Framework for the Decentralisation and Management of Colla...

引用

IEEE Symposium on Network Operations and Management

作者： K. Quinn A. Kenny K. Feeney D. Lewis D. O'Sullivan V.P. Wade Knowledge & Data Engineering Group Department of Computer Science Trinity College Dublin Dublin Ireland

When deploying collaborative applications such as instant messaging in ubiquitous computing environments significant enhancements can be afforded by offering additional context information, such as location information. However, such environments exert key challenges such as increased diversity of ownership and ad hoc, intermittent network connectivity that suits more decentralized computing architectures. This paper examines how a migration to a more decentralized collaborative architecture can be achieved together with a decentralization of the management of collaborative activities

关键词： Environmental management Collaboration Ubiquitous computing Access control Application software computer architecture Routing Humans Content management Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Global Asynchronous Distributed Interactive Genetic Algorithm

Global Asynchronous Distributed Interactive Genetic Algorith...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Mitsunori Miki Yuki Yamamoto Sanae Wake Tomoyuki Hiroyasu Department of Knowledge Engineering and Computer Science Doshisha University Kyotanabe Kyoto Japan School of Engineering Doshisha University Japan Department of Information and Media Doshisha Women's College Kyotanabe Kyoto Japan Department of Knowledge Engineering and Computer Science Doshisha University Japan

We have already proposed Parallel Distributed Interactive Genetic Algorithm(PDIGA) that enables Interactive Genetic Algorithm (IGA) to be done at the same time by two or more people. In PDIGA, the synchronization of the generations is necessary among the subpopulations or users. Therefore, PDIGA is not appropriate for the situation with a large number of people in separate areas. In this paper, we propose Global Asynchronous Distributed Interactive Genetic Algorithm (GADIGA) as an algorithm for creating better design solutions with many people without synchronization. It is found that the asynchronous evolution is effective for making satisfying design solutions with the use of a database of elite individuals. Moreover, it is found that the users can generate more excellent design solutions by repeating the design process because better elite solutions are accumulated in the elite database. For two groups with different sensibilities, it is found that the exchange of design solutions between the groups is less than the one in the groups, but the exchange between the groups plays an important role. From the experimental results, GADIGA is found to be effective for creating better design solutions with many people in separate areas.

关键词： Genetic algorithms Humans Optimization methods Collaboration Databases IEC Cybernetics Algorithm design and analysis Process design Product design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：