Sciweavers

2346 search results - page 353 / 470
» Discovering Case Knowledge Using Data Mining
Sort
View
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
14 years 2 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
14 years 2 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
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 1 days ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
PVLDB
2010
161views more  PVLDB 2010»
13 years 6 months ago
Annotating and Searching Web Tables Using Entities, Types and Relationships
Tables are a universal idiom to present relational data. Billions of tables on Web pages express entity references, attributes and relationships. This representation of relational...
Girija Limaye, Sunita Sarawagi, Soumen Chakrabarti
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson