3934 search results - page 191 / 787 » A monothetic clustering method |
244
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
176
Voted
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
181
click to vote
AIIA
2009
Springer
16 years 1 months ago
2009
Springer
This paper addresses the indexing and retrieval of mathematical symbols from digitized documents. The proposed approach exploits Shape Contexts (SC) to describe the shape of mathe...
157
click to vote
SIGIR
2005
ACM
16 years 6 days ago
2005
ACM
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
201
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...