SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. More...
详细信息
SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm “Local-SimRank”. The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically.
Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in ...
详细信息
ISBN:
(纸本)9781424452422
Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.
To realize the vision of the semantic web it is essential to be able to exchange formal modeled knowledge between applications and humans without loss of meaning. In this paper, we focus on questions relating to meani...
详细信息
To realize the vision of the semantic web it is essential to be able to exchange formal modeled knowledge between applications and humans without loss of meaning. In this paper, we focus on questions relating to meaning, interpretation and subject identity in modern semantic web languages. Based on the semiotic triangle we show that topics as well as RDF resources are symbols, representing concepts and not referents as the common term "subject" would indicate. A subject can not be represented as a single entity, but rather as a complex and evolving system of different concepts. Based on this insight we explain how the resulting plurality and uncertainness of the interpretation of symbols can be handled using semantic mappings. By defining transformation rules, the exchange and integration of knowledge from different semantic models becomes possible. Concluding we define recommendations and design guidelines for a semantic mapping management system, which is needed to support users and applications in creating, reusing, managing and applying such semantic mappings.
Modern smart buildings utilize sensor networks for facilities management applications such as energy monitoring. However as buildings become progressively more embedded with sensor networks, the challenge of managing ...
详细信息
Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in ...
详细信息
Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.
Here we present the SimCon tool to enable evaluators of pervasive applications to rapidly place and configure context sources within a Virtual Reality Environment to conduct repeatable evaluations early in the develop...
详细信息
Both Content analysis and link, analysis have its advantages in measuring relationships among documents. In this paper. we propose a new method to combine these two methods to compute the similarity of research papers...
详细信息
ISBN:
(纸本)9783540881919
Both Content analysis and link, analysis have its advantages in measuring relationships among documents. In this paper. we propose a new method to combine these two methods to compute the similarity of research papers so that we can do clustering of these papers more accurately. In order to improve the efficiency of similarity calculation, we develop a strategy to deal with the relationship graph separately, without affecting the accuracy. We also design an approach to assign different weights to different links to the papers, which can enhance the accuracy of similarity calculation. The experimental results conducted oil ACM data Set show that our new algorithm. S-SimRank, outperforms other algorithms.
In the last years several drafts, recommendations and concepts for a graphical notation for Topic Maps have been published, but till today no graphical notation is generally approved and used in the Topic Maps communi...
详细信息
ISBN:
(纸本)9783941152052
In the last years several drafts, recommendations and concepts for a graphical notation for Topic Maps have been published, but till today no graphical notation is generally approved and used in the Topic Maps community. In this paper we present GTMalpha as a conceptual new notation for a graphical representation of Topic Maps. Our objective is, to provide a practical usable notation, which allows a complete, consistent as well as easy to use graphical representation of any given topic map draft. GTMalpha provides a domain as well as a subject centric view and most important it considers the unique characteristics of the Topic Maps paradigm. This paper serves as a user oriented GTMalpha manual for ontology designers, domain experts as well as users.
Despite the significant research over the last ten years, commercial ubiquitous computing environments and pervasive applications remain thin on the ground. This paper looks at the explosion in application creativity ...
详细信息
Blogs, Wikis, and Social Bookmark Tools have rapidly emerged on the Web. The reasons for their immediate success are that people are happy to share information, and that these tools provide an infrastructure for doing...
详细信息
暂无评论