Sciweavers

274 search results - page 31 / 55
» Ranking with Uncertain Labels
Sort
View
SSDBM
2005
IEEE
159views Database» more  SSDBM 2005»
14 years 2 months ago
Clustering Moving Objects via Medoid Clusterings
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
Hans-Peter Kriegel, Martin Pfeifle
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 9 months ago
Ordering patterns by combining opinions from multiple sources
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...
Pang-Ning Tan, Rong Jin
BMCBI
2004
143views more  BMCBI 2004»
13 years 8 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
IJCV
2011
264views more  IJCV 2011»
13 years 3 months ago
Cost-Sensitive Active Visual Category Learning
Abstract We present an active learning framework that predicts the tradeoff between the effort and information gain associated with a candidate image annotation, thereby ranking un...
Sudheendra Vijayanarasimhan, Kristen Grauman
ICML
2005
IEEE
14 years 9 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan