Sciweavers

1414 search results - page 228 / 283
» Relational peculiarity-oriented mining
Sort
View
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 3 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
WSDM
2009
ACM
115views Data Mining» more  WSDM 2009»
14 years 3 months ago
Discovering and using groups to improve personalized search
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...
Jaime Teevan, Meredith Ringel Morris, Steve Bush
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 3 months ago
Primal sparse Max-margin Markov networks
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...
Jun Zhu, Eric P. Xing, Bo Zhang
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 3 months ago
Combinatorial Framework for Similarity Search
—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 ...
Yury Lifshits
ICDM
2009
IEEE
110views Data Mining» more  ICDM 2009»
14 years 3 months ago
Finding Maximal Fully-Correlated Itemsets in Large Databases
—Finding the most interesting correlations among items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding ...
Lian Duan, William Nick Street