Algorithms for storytelling

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 604-610

  Kumar, Deept ^a   Ramakrishnan, Naren ^a   Helm, Richard F ^b   Potts, Malcolm ^b  

^a Virginia Polytechnic Institute and State University   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Data mining; Redescription; Storytelling

Indexed keywords

COMPUTER SYSTEMS; DATA MINING; DATABASE SYSTEMS; GENES; PROBLEM SOLVING; SET THEORY;

BIOINFORMATICS; DATASETS; REDESCRIPTION; STORY TELLING;

LEARNING ALGORITHMS;

EID: 33749582551     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150475     Document Type: Conference Paper

References (13)

1. C.C. Aggarwal, J.L. Wolf, and P.S. Yu. A New Method for Similarity Indexing of Market Basket Data. In Proc. SIGMOD'99, pages 407-418, 1999.
2. L. Getoor. Link Mining: A New Data Mining Challenge. SIGKDD Explorations, Vol. 5(1):pages 84-89, 2003.
3. R. Guha, R. Kumar, D. Sivakumar, and R. Sundaram. Unweaving a Web of Documents. In Proc. KDD'05, pages 574-579, 2005.
4. A. Kuchinsky, K. Graham, D. Moh, A. Adler, K. Babaria, and M.L. Creech. Biological Storytelling: a Software Tool for Biological Information Organization based upon Narrative Structure. ACM SIGGROUP Bulletin, Vol. 23(2):pages 4-5, Aug 2002.
5. M. Meila. Comparing Clusterings by the Variation of Information. In Proc. COLT'03, pages 173-187, 2003.
6. A.W. Moore and M.S. Lee. Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets. JAIR, Vol. 8:pages 67-91, 1998.
7. A. Nanopoulos and Y. Manolopoulos. Efficient Similarity Search for Market Basket Data. VLDB Journal, Vol. 11(2):pages 138-152, 2002.
8. J. Neville and D. Jensen. Supporting Relational Knowledge Discovery: Lessons in Architecture and Algorithm Design. In Proc. Data Mining Lessons Learned Workshop, ICML'02, 2002.
9. L. Parida and N. Ramakrishnan. Redescription Mining: Structure Theory and Algorithms. In Proc. AAAI'05, pages 837-844, 2005.
10. N. Ramakrishnan, D. Kumar, B. Mishra, M. Potts, and R.F. Helm. Turning CARTwheels: An Alternating Algorithm for Mining Redescriptions. In Proc. KDD'04, pages 266-275, 2004.
11. S. Sarawagi and A. Kirpal. Efficient Set Joins on Similarity Predicates. In Proc. SIGMOD'04, pages 743-754, June 2004.
12. D.A. Simovici and S. Jaroszewicz. An Axiomatization of Partition Entropy. IEEE Transactions on Information Theory, Vol. 48(7):pages 2138-2142, 2002.
13. D.R. Swanson and N.R. Smalheiser. An Interactive System for Finding Complementary Literatures: A Stimulus to Scientific Discovery. Artificial Intelligence, Vol. 91(2):pages 183-203, 1997.