Sciweavers

1601 search results - page 96 / 321
» Closed Sets for Labeled Data
Sort
View
159
Voted
SIGIR
2005
ACM
15 years 10 months ago
Multi-label informed latent semantic indexing
Latent semantic indexing (LSI) is a well-known unsupervised approach for dimensionality reduction in information retrieval. However if the output information (i.e. category labels...
Kai Yu, Shipeng Yu, Volker Tresp
ICMLA
2008
15 years 6 months ago
A Weighted Distance Measure for Calculating the Similarity of Sparsely Distributed Trajectories
This article presents a method for the calculating similarity of two trajectories. The method is especially designed for a situation where the points of the trajectories are distr...
Pekka Siirtola, Perttu Laurinen, Juha Röning
154
Voted
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 6 months ago
Active learning for biomedical citation screening
Active learning (AL) is an increasingly popular strategy for mitigating the amount of labeled data required to train classifiers, thereby reducing annotator effort. We describe ...
Byron C. Wallace, Kevin Small, Carla E. Brodley, T...
203
Voted
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 7 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
161
Voted
ASIACRYPT
2010
Springer
15 years 2 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara