Sciweavers

164 search results - page 9 / 33
» Finding Frequent Patterns in a Large Sparse Graph
Sort
View
CORR
2012
Springer
250views Education» more  CORR 2012»
13 years 5 months ago
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
Arlei Silva, Wagner Meira Jr., Mohammed J. Zaki
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
15 years 9 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
160
Voted
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
15 years 10 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
15 years 9 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
IS
2007
14 years 9 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