NDLI: Discovering Frequent Graph Patterns Using Disjoint Paths

Content Provider	IEEE Xplore Digital Library
Author	Gudes, E. Shimony, S.E. Vanetik, N.
Copyright Year	1989
Abstract	Whereas data mining in structured data focuses on frequent data values, in semistructured and graph data mining, the issue is frequent labels and common specific topologies. The structure of the data is just as important as its content. We study the problem of discovering typical patterns of graph data, a task made difficult because of the complexity of required subtasks, especially subgraph isomorphism. In this paper, we propose a new apriori-based algorithm for mining graph data, where the basic building blocks are relatively large, disjoint paths. The algorithm is proven to be sound and complete. Empirical evidence shows practical advantages of our approach for certain categories of graphs
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	1441
Ending Page	1456
Page Count	16
File Size	2801037
File Format	PDF
ISSN	10414347
Volume Number	18
Issue Number	11
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-11-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data mining XML Motion pictures Relational databases Object oriented modeling Computer Society Image databases Object oriented databases Topology Web mining graph mining. Database applications data mining mining methods and algorithms
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Mining closed and maximal frequent subtrees from databases of labeled rooted trees

Beyond the relational database model

On modeling cost functions for object-oriented databases

A graph-oriented object database model

Database technology on the web

Discovering Frequent Closed Partial Orders from Strings

A highly effective partition selection policy for object database garbage collection

Object-oriented database management systems: evolution and performance issues

Discovering structural association of semistructured data

Discovering Frequent Graph Patterns Using Disjoint Paths

Similar Documents

Mining closed and maximal frequent subtrees from databases of labeled rooted trees

Beyond the relational database model

On modeling cost functions for object-oriented databases

A graph-oriented object database model

Database technology on the web

Discovering Frequent Closed Partial Orders from Strings

A highly effective partition selection policy for object database garbage collection

Object-oriented database management systems: evolution and performance issues

Discovering structural association of semistructured data

Discovering Frequent Graph Patterns Using Disjoint Paths