Sciweavers

74 search results - page 4 / 15
» Pattern Mining in Frequent Dynamic Subgraphs
Sort
View
SAC
2004
ACM
15 years 5 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
IS
2007
14 years 11 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
14 years 10 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
84
Voted
ICDM
2008
IEEE
123views Data Mining» more  ICDM 2008»
15 years 6 months ago
Mining Periodic Behavior in Dynamic Social Networks
Social interactions that occur regularly typically correspond to significant yet often infrequent and hard to detect interaction patterns. To identify such regular behavior, we p...
Mayank Lahiri, Tanya Y. Berger-Wolf
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
16 years 1 months ago
A Partition-Based Approach to Graph Mining
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
Junmei Wang, Wynne Hsu, Mong-Li Lee, Chang Sheng