364 search results - page 63 / 73 » Discovering Hidden Evidence |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
Web search engines discover indexable documents by recursively ‘crawling’ from a seed URL. Their rankings take into account link popularity. While this works well, it introduc...