Sciweavers

2932 search results - page 75 / 587
» Higher order mining
Sort
View
DKE
2007
105views more  DKE 2007»
15 years 4 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
AUSDM
2006
Springer
112views Data Mining» more  AUSDM 2006»
15 years 8 months ago
The Scamseek Project - Text Mining for Financial Scams on the Internet
The Scamseek project, as commissioned by ASIC has the principal objective of building an industrially viable system that retrieves potential scam candidate documents from the Inte...
Jon Patrick
ORDER
2006
102views more  ORDER 2006»
15 years 4 months ago
Profinite Completions and Canonical Extensions of Heyting Algebras
Guram Bezhanishvili, Mai Gehrke, Ray Mines, Patric...
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 8 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
144
Voted
VLDB
2005
ACM
118views Database» more  VLDB 2005»
15 years 10 months ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng