Iterative structure discovery in graph-based data

International Journal on Artificial Intelligence Tools

Volumn 14, Issue 1-2, 2005, Pages 101-124

  Coble, Jeffrey A ^a   Rathi, Runu ^a   Cook, Diane J ^a   Holder, Lawrence B ^a  

^a The University of Texas at Arlington   (United States)

Author keywords

Graph partitioning; Incremental discovery; Machine learning; Structural data mining

Indexed keywords

EID: 32844461424     PISSN: 02182130     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218213005002016     Document Type: Conference Paper

References (19)

1. L. Holder, D. Cook, J. Gonzalez, and I. Jonyer 2002. Structural Pattern Recognition in Graphs. In Pattern Recognition and String Matching, Chen, D. and Cheng, X. eds. Kluwer Academic Publishers, 2002.
2. J. Rissanen, Stochastic Complexity in Statistical Inquiry. World Scientific Publishing Company, 1989.
3. D. Cook, and L. Holder,. Substructure Discovery Using Minimum Description Length and Background Knowledge. In Journal of Artificial Intelligence Research, Volume 1, pages 231-255, 1994.
4. A. Blum. On-line Algorithms in Machine Learning. In Proceedings of the Workshop on On-Line Algorithms, Dagstuhl, 1996.
5. N. Friedman and M. Goldszmidt. Sequential Update of Bayesian Network Structure. In Proceedings 13th Conf. on Uncertainty in Artificial Intelligence, 1997.
6. R. Agrawal, R. Srikant: Mining Sequential Patterns, Proceedings of the Int'l Conference on Data Engineering, Taipei, Taiwan, 1995.
7. G. Hulten, L. Spencer, and P. Domingos. Mining Time-Changing Data Streams. KDD-01, San Francisco, CA, 2001.
8. H. Wang, W. Fan, P. Yu and J. Han. Mining Concept-Drifting Data Streams Using Ensemble Classifiers, in the 9th ACM International Conference on Knowledge Discovery and Data Mining, 2003.
9. R. Agrawal, and G. Psaila. Active Data Mining. In Proceedings of the 1st Int'l Conference on Knowledge Discovery in Databases and Data Mining, 1995.
10. A. Savasere, E. Omiecinsky, and S. Navathe. An Efficient Algorithm for Mining Association Rules in Large Databases. 21st Int'l Cong. on Very Large Databases (VLDB), Zurich, Switzerland, 1995.
11. P. Shenoy, J.R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbo-charging Vertical Mining of Large Databases. ACM SIGMOD Int'l Conference on Managementof Data, 2000.
12. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. ACM SIGMOD Int'lConference on Management of Data, 2000.
13. H. Toivonen. Sampling Large Databases for Association Rules. In Proceedings Int. Conf. Very Large Data Bases. Morgan Kaufman, 1996.
14. D. J. Cook, L. B. Holder, G. Galal, and R. Maglothin, Approaches to Parallel Graph-Based Knowledge Discovery, Journal of Parallel and Distributed Computing, 61(3), pages 427-446, 2001.
15. T. Mitchell. Machine Learning. McGraw Hill, 1997.
16. V. N. Vapnik. The Nature of Statistical Learning Theory. Springer, New York, NY, USA, 1995.
17. G. Widmer. and M. Kubat. Learning in the Presence of Concept Drift and Hidden Contexts. Machine Learning, 23, 69-101, 1996.
18. B. W. Kerninghan and S. Lin. An Efficient Heuristic for Partitioning Graphs. Bell Systems Tech. J., 49:421-308, 1970.
19. C. Fiduccia and R. Matheyses, A Linear-Time Heuristic for Improving Network Partitions. In ACM/IEEE Design Automation Conference, pp. 175-181, 1982.