Sciweavers

1413 search results - page 79 / 283
» Mining Multiple Large Databases
Sort
View
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 3 months ago
On Computing Condensed Frequent Pattern Bases
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 11 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 8 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 10 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
14 years 10 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra