374 search results - page 43 / 75 » New Algorithms for Fast Discovery of Association Rules |
143
click to vote
IJRR
2007
15 years 6 months ago
2007
In this paper a novel Polar Scan Matching (PSM) approach is described that works in the laser scanner’s polar coordinate system, therefore taking advantage of the structure of t...
156
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
155
click to vote
IJCAI
1997
15 years 7 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
160
click to vote
PR
2006
15 years 6 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
159
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...