Sciweavers

2606 search results - page 485 / 522
» cost 2008
Sort
View
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
14 years 8 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 8 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
14 years 8 months ago
Efficient computation of personal aggregate queries on blogs
There is an exploding amount of user-generated content on the Web due to the emergence of "Web 2.0" services, such as Blogger, MySpace, Flickr, and del.icio.us. The part...
Ka Cheung Sia, Junghoo Cho, Yun Chi, Belle L. Tsen...
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
14 years 8 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 8 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...