DocumentCode :
3268015
Title :
Mining frequent labeled and partially labeled graph patterns
Author :
Vanetik, N. ; Gudes, E.
Author_Institution :
Ben-Gurion Univ., Beer-Sheva, Israel
fYear :
2004
fDate :
30 March-2 April 2004
Firstpage :
91
Lastpage :
102
Abstract :
Whereas data mining in structured data focuses on frequent data values, in semistructured and graph data the emphasis is on frequent labels and common topologies. Here, the structure of the data is just as important as its content. When data contains large amount of different labels, both fully labeled and partially labeled data may be useful. More informative patterns can be found in the database if some of the pattern nodes can be regarded as ´unlabeled´. We study the problem of discovering typical fully and partially labeled patterns of graph data. Discovered patterns are useful in many applications, including: compact representation of source information and a road-map for browsing and querying information sources.
Keywords :
data mining; graph theory; query processing; tree data structures; frequent labeled pattern; information browsing; information querying; partially labeled graph pattern; pattern mining; road-map; Data engineering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering, 2004. Proceedings. 20th International Conference on
ISSN :
1063-6382
Print_ISBN :
0-7695-2065-0
Type :
conf
DOI :
10.1109/ICDE.2004.1319987
Filename :
1319987
Link To Document :
بازگشت