106 search results - page 13 / 22 » Finding Interesting Associations without Support Pruning |
COMBINATORICS
2002
14 years 10 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
IIWAS
2003
14 years 11 months ago
2003
This paper reports a research in progress to study the effect of information seeking behavior on an online purchase intention. There are several strategies people use to find info...
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
The success of "infinite-inventory" retailers such as Amazon.com and Netflix has been ascribed to a "long tail" phenomenon. To wit, while the majority of their...
CINQ
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
NIPS
1998
14 years 11 months ago
1998
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...