1217 search results - page 171 / 244 » On compressing frequent patterns |
115
Voted
GCB
1997
Springer
15 years 8 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
145
click to vote
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
138
click to vote
CICLING
2006
Springer
15 years 7 months ago
2006
Springer
We present a statistical generative model for unsupervised learning of verb argument structures. The model was used to automatically induce the argument structures for the 1,500 mo...
151
click to vote
ENC
2004
IEEE
15 years 7 months ago
2004
IEEE
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
127
click to vote
AAAI
2008
15 years 6 months ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...