Sciweavers

38 search results - page 2 / 8
» Hypergraph Based Clustering in High-Dimensional Data Sets: A...
Sort
View
SSD
2005
Springer
122views Database» more  SSD 2005»
13 years 10 months ago
Selectivity Estimation of High Dimensional Window Queries via Clustering
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
Christian Böhm, Hans-Peter Kriegel, Peer Kr&o...
BMCBI
2007
123views more  BMCBI 2007»
13 years 5 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...
BMEI
2008
IEEE
13 years 7 months ago
Clustering of High-Dimensional Gene Expression Data with Feature Filtering Methods and Diffusion Maps
The importance of gene expression data in cancer diagnosis and treatment by now has been widely recognized by cancer researchers in recent years. However, one of the major challen...
Rui Xu, Steven Damelin, Boaz Nadler, Donald C. Wun...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
13 years 9 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
MICAI
2005
Springer
13 years 10 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...