Sciweavers

2065 search results - page 308 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 2 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
AIIA
2009
Springer
15 years 8 months ago
Ontology-Driven Co-clustering of Gene Expression Data
Abstract. The huge volume of gene expression data produced by microarrays and other high-throughput techniques has encouraged the development of new computational techniques to eva...
Francesca Cordero, Ruggero G. Pensa, Alessia Visco...
IIS
2003
15 years 3 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
IS
2007
15 years 1 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
ICML
2004
IEEE
16 years 2 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall