Sciweavers

32 search results - page 6 / 7
» Deterministic Algorithms for Rank Aggregation and Other Rank...
Sort
View
CIKM
2008
Springer
13 years 9 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
SIGIR
2011
ACM
12 years 10 months ago
Picasso - to sing, you must close your eyes and draw
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...
Aleksandar Stupar, Sebastian Michel
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 9 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
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 26 days ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 7 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...