Sciweavers

2822 search results - page 187 / 565
» Mining Optimized Ranges
Sort
View
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
16 years 4 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 4 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
127
Voted
PAKDD
2009
ACM
127views Data Mining» more  PAKDD 2009»
15 years 11 months ago
Clustering Documents Using a Wikipedia-Based Concept Representation
Abstract. This paper shows how Wikipedia and the semantic knowledge it contains can be exploited for document clustering. We first create a concept-based document representation b...
Anna Huang, David N. Milne, Eibe Frank, Ian H. Wit...
PKDD
2009
Springer
113views Data Mining» more  PKDD 2009»
15 years 11 months ago
Feature Selection for Density Level-Sets
A frequent problem in density level-set estimation is the choice of the right features that give rise to compact and concise representations of the observed data. We present an e...
Marius Kloft, Shinichi Nakajima, Ulf Brefeld
129
Voted
AUSDM
2007
Springer
93views Data Mining» more  AUSDM 2007»
15 years 10 months ago
Customer Analytics Projects: Addressing Existing Problems with a Process that Leads to Success
This article explicitly outlines an approach designed to allow optimal utilisation of Analytics in the industry setting. The paper focuses on the key stages of the Analytics proce...
Inna Kolyshkina, Simeon J. Simoff