Sciweavers

122 search results - page 4 / 25
» An Efficient Algorithm for Mining String Databases Under Con...
Sort
View
PVLDB
2008
201views more  PVLDB 2008»
13 years 6 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
GIS
2006
ACM
14 years 8 months ago
Mining frequent geographic patterns with knowledge constraints
The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large ...
Luis Otávio Alvares, Paulo Martins Engel, S...
WWW
2004
ACM
14 years 8 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
APWEB
2006
Springer
13 years 11 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
Kuo-Yu Huang, Chia-Hui Chang