Sciweavers

3641 search results - page 156 / 729
» On Computability of Pattern Recognition Problems
Sort
View
TALG
2010
158views more  TALG 2010»
14 years 10 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
127
Voted
CVPR
2007
IEEE
15 years 9 months ago
Estimating Cluster Overlap on Manifolds and its Application to Neuropsychiatric Disorders
Although it is usually assumed in many pattern recognition problems that different patterns are distinguishable, some patterns may have inseparable overlap. For example, some faci...
Peng Wang, Christian Köhler, Ragini Verma
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
15 years 7 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
173
Voted
WWW
2011
ACM
14 years 10 months ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
DAWAK
2004
Springer
15 years 8 months ago
Mining Periodic Patterns in Sequence Data
Abstract. Periodic pattern mining is the problem that regards temporal regularity. There are many emerging applications in periodic pattern mining, including web usage recommendati...
Kuo-Yu Huang, Chia-Hui Chang