Sciweavers

5209 search results - page 749 / 1042
» Multiobjective Data Clustering
Sort
View
ICCV
2001
IEEE
16 years 8 months ago
Feature Selection from Huge Feature Sets
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...
José Bins, Bruce A. Draper
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
16 years 8 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 7 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
RECOMB
2008
Springer
16 years 7 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, ...
VLDB
2007
ACM
169views Database» more  VLDB 2007»
16 years 6 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...