2497 search results - page 347 / 500 » A Partial-Repeatability Approach to Data Mining |
140
Voted
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
116
Voted
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
Temporal expressions, such as between 1992 and 2000, are frequent across many kinds of documents. Text retrieval, though, treats them as common terms, thus ignoring their inherent...
129
click to vote
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
129
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Lack of supervision in clustering algorithms often leads to clusters that are not useful or interesting to human reviewers. We investigate if supervision can be automatically tr...
139
Voted
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—It is well known that the key of Bayesian classifier learning is to balance the two important issues, that is, the exploration of attribute dependencies in high orders for ensu...