Sciweavers

1836 search results - page 110 / 368
» Mining Clustering Dimensions
Sort
View
PKDD
2009
Springer
148views Data Mining» more  PKDD 2009»
15 years 8 months ago
Feature Selection by Transfer Learning with Linear Regularized Models
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
Thibault Helleputte, Pierre Dupont
138
Voted
ADMA
2008
Springer
124views Data Mining» more  ADMA 2008»
15 years 3 months ago
Dimensionality Reduction for Classification
We investigate the effects of dimensionality reduction using different techniques and different dimensions on six two-class data sets with numerical attributes as pre-processing fo...
Frank Plastria, Steven De Bruyne, Emilio Carrizosa
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
16 years 2 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 2 months ago
Efficient incremental constrained clustering
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
Ian Davidson, S. S. Ravi, Martin Ester
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
16 years 2 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...