Sciweavers

97 search results - page 3 / 20
» Frequent free tree discovery in graph data
Sort
View
ICDCN
2011
Springer
14 years 1 months ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
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...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
79
Voted
APPINF
2003
14 years 11 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
IS
2010
14 years 8 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 18 hour ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
14 years 11 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara