Mining closed relational graphs with connectivity constraints

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2005, Pages 357-358

  Yan, Xifeng ^a   Zhou, X Jasmine ^b   Hai, Jiawei ^a  

^a University of Illinois ^*  (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 28444499307     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.86     Document Type: Conference Paper

References (4)

1. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
2. T. Washio and H. Motoda. State of the art of graph-based data mining. SIGKDD Explorations, 5:59-68, 2003.
3. Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 15:1101-1113, 1993.
4. X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In Proc. 2003 ACM Int. Conf. on Knowledge Discovery and Data Mining (KDD'03), pages 286-295, Aug. 2003.