837 search results - page 110 / 168 » Hard combinators |
KDD
2008
ACM
16 years 8 days ago
2008
ACM
This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated la...
105
click to vote
KDD
2008
ACM
16 years 8 days ago
2008
ACM
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
103
click to vote
KDD
2007
ACM
16 years 8 days ago
2007
ACM
In many data mining applications, online labeling feedback is only available for examples which were predicted to belong to the positive class. Such applications include spam filt...
KDD
2007
ACM
16 years 8 days ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
114
click to vote
KDD
2007
ACM
16 years 8 days ago
2007
ACM
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...