Sciweavers

116 search results - page 6 / 24
» On Computing Condensed Frequent Pattern Bases
Sort
View
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 8 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
DKE
2002
218views more  DKE 2002»
13 years 7 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
ICRA
2002
IEEE
150views Robotics» more  ICRA 2002»
14 years 12 days ago
Color Landmark Based Self-Localization for Indoor Mobile Robots
We present a simple artificial landmark model and a robust tracking algorithm for the navigation of indoor mobile robots. The landmark model is designed to have a three-dimensiona...
Gi-jeong Jang, Sungho Kim, Wang-Heon Lee, In-So Kw...
COMPUTE
2010
ACM
13 years 11 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 4 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki