ACM Home Page
Please provide us with feedback. Feedback
Report on the First International Workshop on Mining Graphs and Complex Structures (MGCS'07)
Full text PdfPdf (183 KB)
Source
ACM SIGMOD Record archive
Volume 37 ,  Issue 1  (March 2008) table of contents
COLUMN: Reports table of contents
Pages 53-55  
Year of Publication: 2008
ISSN:0163-5808
Authors
Lawrence B. Holder  Washington State University
Xifeng Yan  IBM T. J. Watson Research Center
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 66,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1374780.1374795
What is a DOI?

ABSTRACT

The fast accumulation of graph data is witnessed in a wide range of scientific and commercial domains. Typical graph data include chemical compounds, circuits, biological networks, computer networks, 2D/3D models, XML, RDF and workflows. Graph is regarded as a critical data type for knowledge discovery in bioinformatics, chemical informatics, computer vision, informational retrieval, computer security, semantic web, social science, etc., just to name a few. Unfortunately, due to the lack of graph management and mining tools, it is hard, if not impossible, for users to search and analyze any reasonably large collection of graphs. There is an imminent need for scalable methods for mining and search in graphs and other complex structures.


Collaborative Colleagues:
Lawrence B. Holder: colleagues
Xifeng Yan: colleagues