Sciweavers

1458 search results - page 68 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
171
Voted
BMCBI
2010
153views more  BMCBI 2010»
15 years 5 months ago
Challenges in microarray class discovery: a comprehensive examination of normalization, gene selection and clustering
Background: Cluster analysis, and in particular hierarchical clustering, is widely used to extract information from gene expression data. The aim is to discover new classes, or su...
Eva Freyhult, Mattias Landfors, Jenny Önskog,...
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 8 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
ECCV
2002
Springer
16 years 6 months ago
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"
There has been considerable success in automated reconstruction for image sequences where small baseline algorithms can be used to establish matches across a number of images. In c...
Frederik Schaffalitzky, Andrew Zisserman
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 5 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
WWW
2007
ACM
16 years 5 months ago
Towards effective browsing of large scale social annotations
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
Rui Li, Shenghua Bao, Yong Yu, Ben Fei, Zhong Su