Sciweavers

766 search results - page 25 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 9 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
ICPR
2004
IEEE
14 years 9 months ago
Feature Selection and Gene Clustering from Gene Expression Data
In this article we describe an algorithm for feature selection and gene clustering from high dimensional gene expression data. The method is based on measuring similarity between ...
D. Dutta Majumder, Pabitra Mitra
CIDM
2007
IEEE
14 years 3 months ago
Mining Subspace Correlations
— In recent applications of clustering such as gene expression microarray analysis, collaborative filtering, and web mining, object similarity is no longer measured by physical ...
Rave Harpaz, Robert M. Haralick
DATAMINE
2006
224views more  DATAMINE 2006»
13 years 8 months ago
Characteristic-Based Clustering for Time Series Data
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is cr...
Xiaozhe Wang, Kate A. Smith, Rob J. Hyndman
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 9 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...