Sciweavers

214 search results - page 28 / 43
» New Parallel Algorithms for Frequent Itemset Mining in Very ...
Sort
View
VLDB
1998
ACM
192views Database» more  VLDB 1998»
13 years 11 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
13 years 11 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ICDE
2012
IEEE
212views Database» more  ICDE 2012»
11 years 9 months ago
Attribute-Based Subsequence Matching and Mining
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
Yu Peng, Raymond Chi-Wing Wong, Liangliang Ye, Phi...
JCIT
2010
174views more  JCIT 2010»
13 years 1 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
APIN
2008
116views more  APIN 2008»
13 years 6 months ago
Updating generalized association rules with evolving taxonomies
Abstract-Mining generalized association rules between items in the presence of taxonomy has been recognized as an important model in data mining. Earlier work on mining generalized...
Ming-Cheng Tseng, Wen-Yang Lin, Rong Jeng