Sciweavers

847 search results - page 35 / 170
» Approximation algorithms for projective clustering
Sort
View
115
Voted
AI
2005
Springer
15 years 6 months ago
Comparing Dimension Reduction Techniques for Document Clustering
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
Bin Tang, Michael A. Shepherd, Malcolm I. Heywood,...
JMLR
2010
211views more  JMLR 2010»
14 years 7 months ago
Minimum Conditional Entropy Clustering: A Discriminative Framework for Clustering
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...
Bo Dai, Baogang Hu
115
Voted
ICALP
2011
Springer
14 years 4 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
83
Voted
JCP
2008
103views more  JCP 2008»
15 years 16 days ago
Weighted Clustering and Evolutionary Analysis of Hybrid Attributes Data Streams
It presents some definitions of projected cluster and projected cluster group on hybrid attributes after having given some definitions on ordered attributes and sorted attributes t...
Xinquan Chen
93
Voted
JAT
2010
71views more  JAT 2010»
14 years 11 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes