113 search results - page 6 / 23 » Frequent subgraph pattern mining on uncertain graph data |
129
Voted
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
81
Voted
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
IFIP12
2007
14 years 11 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
KAIS
2010
14 years 8 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...