The KOJAK group finder: Connecting the dots via integrated knowledge-based and statistical reasoning

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 800-807

  Adibi, Jafar ^a   Chalupsky, Hans ^a   Melz, Eric ^a   Valente, Andre ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATASETS; GROUP FINDER (GF); KNOWLEDGE REPRESENTATION AND REASONING (KR&R); LINK DISCOVERY (LD);

ARTIFICIAL INTELLIGENCE; DATA ACQUISITION; DATABASE SYSTEMS; INFORMATION TECHNOLOGY; KNOWLEDGE REPRESENTATION; STATISTICAL METHODS;

DATA MINING;

EID: 9444291267     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Adibi, J., Valente, A., Chalupsky, H. & Melz, E. (2004). Group detection via a mutual information model. Submitted to KDD 2004.
2. Butte, A. & Kohane, I. (2000). Mutual information relevance networks: Functional genomic clustering using pairwise entropy measurements. Pacific Symposium on Biocomputing. Honolulu, Hawaii.
3. Cohn, D. & Hofmann, T. (2001). The missing link: a probabilistic model of document content and hypertext connectivity. Advances in Neural Information Processing Systems 13: 430-436.
4. Friedman, N., Getoor, L., Koller, D. & Pfeffer, A. (1999). Learning probabilistic relational models. IJCAI 1999, San Francisco, Morgan Kaufmann Publishers.
5. Getoor, L., Segal, E., Taskar, B., & Koller, D. (2001). Probabilistic models of text and link structure for hypertext classification. IJCAI 2001 Workshop on Text Learning: Beyond Supervision. Seattle, Washington.
6. Gibson, D., Kleinberg, J. & Raghavan, P. (1998). Inferring Web communities from link topology. In Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia. New York, ACM Press.
7. Kubica, J., Moore, A., Cohn, D. & Schneider, J. (2003). Finding underlying connections: a fast method for link analysis and collaboration queries. International Conference on Machine Learning (ICML).
8. Kubica, J., Moore, A., Schneider, J. & Yang, Y. (2002). Stochastic link and group detection. Eighteenth National Conference on Artificial Intelligence (AAAI).
9. Li, W. (1990). Mutual information functions versus correlation functions. Journal of Statistical Physics 60: 823-837.
10. Lin, S. & Chalupsky, H., Using unsupervised link discovery methods to find interesting facts and connections in a bibliography dataset. SIGKDD Explorations, 5(2): 173-178, December 2003
11. Ng, A., Zheng, A. & Jordan, M. (2001). Link analysis, eigenvectors and stability. IJCAI 2001.
12. PowerLoom (2003). www.isi.edu/isd/LOOM/PowerLoom.
13. Schrag, R. et. al. (2003). EELD Y2 LD-PL Performance Evaluation, Information Extraction and Transport, Inc.
14. Senator, T. (2002). Evidence Extraction and Link Discovery, DARPA Tech 2002.
15. Shannon, C. (1948). A Mathematical Theory of Communication. Bell System Tech. Journal 27: 379-423.
16. Silk, B. & Bergen, B. (2003). EELD Evidence Database Description, Information Extraction and Transport, Inc.