581 search results - page 25 / 117 » EM in High Dimensional Spaces |
ICDM
2008
IEEE
15 years 5 months ago
2008
IEEE
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
102
click to vote
EDBT
2000
ACM
15 years 3 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
107
click to vote
COCOON
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
113
click to vote
JMLR
2002
14 years 10 months ago
2002
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
WSC
2001
15 years 1 days ago
2001
This paper investigates the dimensionality characteristics of the outcome space of a combat simulation. The independent state variables of all of the outcome states for a simulati...