9849 search results - page 148 / 1970 » Algorithms and Experiments for the Webgraph |
156
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
123
click to vote
FIMI
2004
15 years 6 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
138
click to vote
FIMI
2004
15 years 6 months ago
2004
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
136
Voted
FLAIRS
2004
15 years 6 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
129
click to vote
EACL
2006
ACL Anthology
15 years 6 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...