Sciweavers

319 search results - page 9 / 64
» Algorithms for Mining Distance-Based Outliers in Large Datas...
Sort
View
KDD
2008
ACM
234views Data Mining» more  KDD 2008»
15 years 10 months ago
Angle-based outlier detection in high-dimensional data
Detecting outliers in a large set of data objects is a major data mining task aiming at finding different mechanisms responsible for different groups of objects in a data set. All...
Hans-Peter Kriegel, Matthias Schubert, Arthur Zime...
SIGMOD
2004
ACM
196views Database» more  SIGMOD 2004»
15 years 10 months ago
FARMER: Finding Interesting Rule Groups in Microarray Datasets
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
Gao Cong, Anthony K. H. Tung, Xin Xu, Feng Pan, Ji...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
15 years 10 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
KDD
2003
ACM
145views Data Mining» more  KDD 2003»
15 years 10 months ago
Carpenter: finding closed patterns in long biological datasets
The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example,...
Feng Pan, Gao Cong, Anthony K. H. Tung, Jiong Yang...
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
15 years 11 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010