253 search results - page 3 / 51 » Using and Learning Semantics in Frequent Subgraph Mining |
PKDD
2004
Springer
13 years 10 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...
ICDCN
2011
Springer
12 years 9 months ago
2011
Springer
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
ICDM
2007
IEEE
13 years 11 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...
ECEASST
2006
13 years 5 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
IFIP12
2007
13 years 7 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...