Sciweavers

2600 search results - page 4 / 520
» Clustering with or without the Approximation
Sort
View
ECIR
2006
Springer
13 years 8 months ago
Phrase Clustering Without Document Context
Abstract. We applied different clustering algorithms to the task of clustering multi-word terms in order to reflect a humanly built ontology. Clustering was done without the usual ...
Eric SanJuan, Fidelia Ibekwe-Sanjuan
ICPR
2008
IEEE
14 years 8 months ago
Time-series clustering by approximate prototypes
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
Pasi Fränti, Pekka Nykänen, Ville Hautam...
ICDAR
2007
IEEE
14 years 1 months ago
Representing and Characterizing Handwritten Mathematical Symbols through Succinct Functional Approximation
We model on-line ink traces for a set of 219 symbols to “best fit” low-degree polynomial series. Using a collection of mathematical writing samples, we find that in many cas...
Bruce W. Char, Stephen M. Watt
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
12 years 9 months ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...
IPM
2006
64views more  IPM 2006»
13 years 6 months ago
Text mining without document context
We consider a challenging clustering task: the clustering of muti-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, ...
Eric SanJuan, Fidelia Ibekwe-Sanjuan