Sciweavers

504 search results - page 21 / 101
» PCS: An Efficient Clustering Method for High-Dimensional Dat...
Sort
View
LWA
2007
13 years 9 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
KDD
2001
ACM
169views Data Mining» more  KDD 2001»
14 years 8 months ago
Hierarchical cluster analysis of SAGE data for cancer profiling
In this paper we present a method for clustering SAGE (Serial Analysis of Gene Expression) data to detect similarities and dissimilarities between different types of cancer on the...
Jörg Sander, Monica C. Sleumer, Raymond T. Ng
ACIIDS
2010
IEEE
170views Database» more  ACIIDS 2010»
13 years 5 months ago
On the Effectiveness of Gene Selection for Microarray Classification Methods
Microarray data usually contains a high level of noisy gene data, the noisy gene data include incorrect, noise and irrelevant genes. Before Microarray data classification takes pla...
Zhongwei Zhang, Jiuyong Li, Hong Hu, Hong Zhou
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
13 years 9 months ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester
PRL
2011
13 years 2 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino