541 search results - page 72 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
115
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
142
Voted
SAC
2008
ACM
15 years 1 months ago
2008
ACM
A major obstacle that decreases the performance of text classifiers is the extremely high dimensionality of text data. To reduce the dimension, a number of approaches based on rou...
127
Voted
COLING
1996
15 years 3 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
113
Voted
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
127
Voted
JCST
2008
15 years 2 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...