Sciweavers

766 search results - page 41 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 10 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
NIPS
2007
13 years 10 months ago
Unsupervised Feature Selection for Accurate Recommendation of High-Dimensional Image Data
Content-based image suggestion (CBIS) targets the recommendation of products based on user preferences on the visual content of images. In this paper, we motivate both feature sel...
Sabri Boutemedjet, Djemel Ziou, Nizar Bouguila
BMCBI
2004
181views more  BMCBI 2004»
13 years 8 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
RECOMB
2008
Springer
14 years 9 months ago
CompostBin: A DNA Composition-Based Algorithm for Binning Environmental Shotgun Reads
A major hindrance to studies of microbial diversity has been that the vast majority of microbes cannot be cultured in the laboratory and thus are not amenable to traditional method...
Sourav Chatterji, Ichitaro Yamazaki, Zhaojun Bai, ...
ICA
2004
Springer
14 years 2 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter