A similarity reinforcement algorithm for heterogeneous web pages

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development(2005)

引用 3|浏览0
暂无评分
摘要
Many machine learning and data mining algorithms crucially rely on the similarity metrics. However, most early research works such as Vector Space Model or Latent Semantic Index only used single relationship to measure the similarity of data objects. In this paper, we first use an Intra- and Inter- Type Relationship Matrix (IITRM) to represent a set of heterogeneous data objects and their inter-relationships. Then, we propose a novel similarity-calculating algorithm over the Inter- and Intra- Type Relationship Matrix. It tries to integrate information from heterogeneous sources to serve their purposes by iteratively computing. This algorithm can help detect latent relationships among heterogeneous data objects. Our new algorithm is based on the intuition that the intra-relationship should affect the inter-relationship, and vice versa. Experimental results on the MSN logs dataset show that our algorithm outperforms the traditional Cosine similarity.
更多
查看译文
关键词
similarity reinforcement algorithm,latent semantic index,heterogeneous data object,similarity metrics,data mining,heterogeneous web page,msn log,traditional cosine similarity,heterogeneous source,type relationship matrix,data object,new algorithm,web pages,vector space model,machine learning,latent semantic indexing
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要