694 search results - page 81 / 139 » On the Dimensions of Data Complexity through Synthetic Data ... |
SBACPAD
2003
IEEE
14 years 2 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
DAGM
2010
Springer
13 years 10 months ago
2010
Springer
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
We present a manifold learning approach to dimensionality
reduction that explicitly models the manifold as a mapping
from low to high dimensional space. The manifold is
represen...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
VMV
2001
13 years 10 months ago
2001
We present a new approach for the coarse segmentation of tubular structures in 3D image data. Our algorithm, which requires only few initial values and minimal user interaction, c...