MatchSim: A novel neighbor-based similarity measure with maximum neighborhood matching

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 1613-1616

  Lin, Zhenjiang ^a   Lyu, Michael R ^a   King, Irwin ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Graph algorithm; Link analysis; Similarity measure; Web mining

Indexed keywords

GRAPH ALGORITHMS; LINK ANALYSIS; MAXIMUM MATCHINGS; NEIGHBORHOOD STRUCTURE; REAL DATA SETS; SIMILARITY MEASURE; WEB APPLICATION; WEB DIRECTORIES; WEB MINING; WEB PAGE;

COMPUTATIONAL COMPLEXITY; KNOWLEDGE MANAGEMENT; SEARCH ENGINES;

WORLD WIDE WEB;

EID: 74549164188     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646185     Document Type: Conference Paper

References (18)

1. L. Adamic and E. Adar. Friends and neighbors on the Web. Social Networks, 25(3):211-230, 2003.
2. R. A. Baeza-Yates and B. A. Ribeiro-Neto. Modern Information Retrieval. ACM Press/Addison-Wesley, 1999.
3. H. Chim and X. Deng. A new su x tree similarity measure for document clustering. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 121-130, NY, USA, 2007.
4. J. Dean and M. R. Henzinger. Finding related pages in the World Wide Web. Computer Networks, 31(11-16):1467-1479, 1999.
5. L. Friedland and J. Allan. Joke retrieval: recognizing the same joke told differently. In CIKM '08: Proceeding of the 17th ACM Conference on Information and Knowledge Management, pages 883-892, New York, NY, USA, 2008. ACM.
6. A. Gupta and L. Ying. On algorithms for finding maximum matchings in bipartite graphs. In Technical Report RC 21576 (97320). IBM T. J. Watson Research Center, 1999.
7. A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice-Hall, Inc., NJ, USA, 1988.
8. G. Jeh and J. Widom. SimRank: a measure of structural-context similarity. In KDD '02: Proceedings of the 8th ACM SIGKDD, pages 538-543, NY, USA, 2002. ACM Press.
9. M. Kessler. Bibliographic coupling between scientific papers. American Documentation, 14(10-25), 1963.
10. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
11. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2:83-97, 1955.
12. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03: Proceedings of the 12th International Conference on Information and Knowledge Management, pages 556-559. ACM, November 2003.
13. Z. Lin, I. King, and M. R. Lyu. Pagesim: A novel link-based similarity measure for the World Wide Web. In WI '06: Proceedings of the 5th International Conference on Web Intelligence, pages 687-693, Hong Kong, 2006. IEEE Computer Society.
14. W. Lu, J. Janssen, E. Milios, and N. Japkowicz. Node similarity in networked information spaces. In CASCON '01: Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative research. IBM Press, 2001.
15. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: bringing order to the Web. Technical report, Stanford Digital Library Technologies Project, 1998.
16. T. Roelleke and J. Wang. Tf-idf uncovered: a study of theories and probabilities. In SIGIR '08: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pages 435-442, New York, NY, USA, 2008. ACM.
17. G. Salton. Automatic Text Processing. Addison-Wesley, 1989.
18. H. Small. Co-citation in the scientific literature: a new measure of the relationship between two documents. Journal of the American Society for Information Science, 24(265-269), 1973.