1248 search results - page 71 / 250 » Comparable Entity Mining from Comparative Questions |
110
click to vote
FIMI
2003
15 years 4 months ago
2003
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...
121
Voted
CSUR
2000
15 years 3 months ago
2000
to extract information at a level of abstraction that is useful to investigators interested in analyzing application usage or evaluating usability. This survey examines computer-ai...
158
Voted
HIS
2008
15 years 4 months ago
2008
This paper introduces a multiobjective grammar based genetic programming algorithm to solve a Web Mining problem from multiple instance perspective. This algorithm, called MOG3P-MI...
128
click to vote
FIMI
2004
15 years 4 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...
118
Voted
COLING
2010
14 years 10 months ago
2010
This paper1 presents an empirical approach to mining parallel corpora. Conventional approaches use a readily available collection of comparable, nonparallel corpora to extract par...