Information shared by many objects

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 1213-1220

  Long, Chong ^a   Zhu, Xiaoyan ^a   Li, Ming ^b   Ma, Bin ^b  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Data mining; Information distance; Kolmogorov complexity; Text mining

Indexed keywords

CORE FEATURES; INFORMATION DISTANCE; INFORMATION SHARED; KOLMOGOROV COMPLEXITY; MINING METHODS; NEW THEORY; TEXT MINING; THERMODYNAMIC ENERGY;

COMPUTATIONAL COMPLEXITY; DATA MINING; KNOWLEDGE MANAGEMENT; MINING;

INFORMATION DISSEMINATION;

EID: 70349250230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458242     Document Type: Conference Paper

References (43)

1. C. Ané and M. Sanderson. Missing the forest for the rees: Phylogenetic compression and its implications for inferring complex evolutionary histories. Systematic Biology, 54(1):146-157, 2005.
2. T. Arbuchle, A. Balaban, D. Peters, and M. Lawford. Software documents: Comparison and measurement. In The Nineteenth International Conference on Software Engineering and Knowledge Engineering, July 2007.
3. D. Benedetto, E. Caglioti, and V. Loreto. Language trees and zipping. Physical Review Letters, 88(4):048702, 2002.
4. C. Bennett, P. Gacs, M. Li, P. Vitányi, and W. Zurek. Information distance. IEEE Transactions on Information Theory, 44(4):1407-1423, July 1998.
5. C. Bennett, M. Li, and B. Ma. Chain letters and evolutionary histories. Scientific American, 288(6):76-81, June 2003.
6. J. Carbonell and J. Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pages 335-336, August 1998.
7. P. Chaovalit and L. Zhou. Movie review mining: a comparison between supervised and unsupervised classification approaches. In HICSS, page 112c, January 2005.
8. X. Chen, B. Francia, M. Li, B. Mckinnon, and A. Seker. Shared information and program plagiarism detection. IEEE Transactions on Information Theory, 50(7):1545-1550, July 2004.
9. A. Chernov, A. Muchnik, A. Romashchenko, A. Shen, and N. Vereshchagin. Upper semi-lattice of binary strings with the relation "x is simple conditional to y". Theoretical Computer Science, 271:69-95, 2002.
10. R. Cilibrasi and P. Vitányi. Clustering by compression. IEEE Transactions on Information Theory, 51(4):1523-1545, 2005.
11. R. Cilibrasi, P. Vitányi, and R. de Wolf. Algorithmic clustring of music based on string compression. Comput. Music J., 28(4):49-67, 2004.
12. R. L. Cilibrasi and P. M. Vitányi. The google similarity distance. IEEE Transactions on Knowledge and Data Engineering, 19(3):370-383, March 2007.
13. M. C. de Marneffe, B. MacCartney, and C. D. Manning. Generating typed dependency parses from phrase structure parses. In The fifth international conference on Language Resources and Evaluation (LREC), May 2006.
14. K. Emanuel, S. Ravela, E. Vivant, and C. Risi. A combined statistical-deterministic approach of hurricane risk assessment. manuscript, Program in Atmospheres, Oceans, and Climate, MIT, 2005.
15. M. Gamon, A. Aue, S. C. Oliver, and E. Ringger. Pulse: Mining customer opinions from free text. In International Symposium on Intelligent Data Analysis(IDA), pages 121-132, October 2005.
16. M. Hayashida and T. Akutsu. Image compression-based approach to measuring the similarity of protein structures. In The 6th Asia-Pacific Bioinformatics Conference, pages 221-230, 2008.
17. M. Hu and B. Liu. Mining and summarizing customer reviews. In The 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 168-177, August 2004.
18. E. Keogh, S. Lonardi, and C. Ratanamahatana. Towards parameter-free data mining. In The 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 206-215, August 2004.
19. S. Kirk and S. Jenkins. Information theory-based software metrics and obfuscation. Journal of Systems and Software, 72:179-186, 2004.
20. A. Kocsor, A. Kertesz-Farkas, L. Kajan, and S. Pongor. Application of compression-based distance measures to protein sequence classification: a methodology study. Bioinformatics, 22(4):407-412, 2006.
21. A. Kraskov, H. Stogbauer, R. Andrzejak, and P. Grassberger. Hierarchical clustering using mutual information. Europhys. Lett, 70(2):278-284, 2005.
22. N. Krasnogor and D. Pelta. Measuring the similarity of protein structures by means of the universal similarity metric. Bioinformatics, 20(7):1015-1021, 2004.
23. M. Li, J. Badger, X. Chen, S. Kwong, P. Kearney, and H. Zhang. An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics, 17(2):149-154, 2001.
24. M. Li, X. Chen, X. Li, B. Ma, and P. Vitányi. The similarity metric. IEEE Transactions on Information Theory, 50(12):3250-3264, 2004.
25. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications(2nd Edition). Springer-Verlag, 1997.
26. A. Muchnik. Conditional comlexity and codes. Theoretical Computer Science, 271(1):97-109, 2002.
27. A. Muchnik and N. Vereshchagin. Logical operations and kolmogorov complexity ii. In 16th Annual IEEE Conference on Computational Complexity, pages 256-265, June 2001.
28. M. Nykter, N. Price, M. Aldana, S. Ramsey, S. Kauffman, L. Hood, O. Yli-Harja, and I. Shmulevich. Gene expression dynamic in the macrophage exhibit criticality. PNAS, 105(6):1897-1900, 2008.
29. M. Nykter, N. Price, A. Larjo, T. Aho, S. Kauffman, O. Yli-Harja, and I. Shmulevich. Critical networks exhibit maximal information diversity in structure-dynamics relationships. Physical Review Letters, 100:058702 (1-4), 2008.
30. H. Otu and K. Sayood. A new sequence distance measure for phylogenetic tree construction. Bioinformatics, 19(6):2122-2130, 2003.
31. H. Pao and J. Case. Computing entropy for ortholog detection. In International Conference on Computational Intelligence, December 2004.
32. D. Parry. Use of Kolmogorov distance identification of web page authorship, topic and domain. In Workshop on Open Source Web Inf. Retrieval, 2005.
33. A. M. Popescu and O. Etzioni. Extracting product features and opinions from reviews. In Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 339-346, October 2005.
34. S. Rahmati and J. Glasgow. Noise tolerance of universal similarity metric applied to protein contact maps comparison in two dimensions. manuscript, Queen Univ, 2008.
35. C. Santos, J. Bernardes, P. Vitányi, and L. Antunes. Clustering fetal heart rate tracings by compression. In The 19th IEEE Symposium on Computer-Based Medical Systems, June 2006.
36. A. Shen and N. Vereshchagin. Logical operations and kolmogorov complexity. Theoretical Computer Science, 271:125-129, 2002.
37. A. Siebes and Z. Struzik. Complex data: Mining using patterns. Lecture Notes in Computer Science, 2447:205-229, 2002.
38. W. Taha, S. Crosby, and K. Swadi. A new approach to data mining for software design. manuscript, Rice Univ, 2006.
39. P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In The 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 32-44, July 2002.
40. N. Vereshchagin and M. V'yugin. Independent minimum length programs to translate between given strings. Theoretical Computer Science, 271:131-143, 2002.
41. M. V'yugin. Information distance and conditional complexities. Theoretical Computer Science, 271:145-150, 2002.
42. X. Zhang, Y. Hao, X. Zhu, and M. Li. Information distance from a question to an answer. In The 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2007.
43. L. Zhuang, F. Jing, and X. Zhu. Movie review mining and summarization. In ACM 17th Conference on Information and Knowledge Management (CIKM), pages 43-50, November 2006.