Sciweavers

513 search results - page 56 / 103
» Efficient search for association rules
Sort
View
ANLP
1994
97views more  ANLP 1994»
14 years 11 months ago
Recycling Terms into a Partial Parser
Both full-text information retrieval and large scale parsing require text preprocessing to identify strong lexical associations in textual databases. In order to associate linguis...
Christian Jacquemin
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
15 years 10 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 1 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
ATAL
2006
Springer
15 years 1 months ago
Reducing price fluctuation in continuous double auctions through pricing policy and shout improvement
Auction mechanism design is a subfield of game theory dedicated to manipulating the rules of an auction so as to achieve specific goals. The complexity of the dynamics of auctions...
Jinzhong Niu, Kai Cai, Simon Parsons, Elizabeth Sk...
COLING
1996
14 years 11 months ago
Interpretation of Nominal Compounds: Combining Domain-Independent and Domain-Specific Information
A domain independent model is proposed for the automated interpretation of nominal compounds in English. This model is meant to account for productive rules of interpretation whic...
Cécile Fabre