1897 search results - page 325 / 380 » Mining Chains of Relations |
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
WSDM
2009
ACM
15 years 4 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
WSDM
2009
ACM
15 years 4 months ago
2009
ACM
Personalized Web search takes advantage of information about an individual to identify the most relevant results for that person. A challenge for personalization lies in collectin...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
SISAP
2009
IEEE
15 years 4 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...