Sciweavers

263 search results - page 36 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
COMPGEOM
1997
ACM
14 years 23 days ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
14 years 9 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 9 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
DASFAA
2005
IEEE
171views Database» more  DASFAA 2005»
14 years 2 months ago
Mining Succinct Systems of Minimal Generators of Formal Concepts
Formal concept analysis has become an active field of study for data analysis and knowledge discovery. A formal concept C is determined by its extent (the set of objects that fall...
Guozhu Dong, Chunyu Jiang, Jian Pei, Jinyan Li, Li...
DAWAK
2008
Springer
13 years 10 months ago
Mining Sequential Patterns with Negative Conclusions
Abstract. The new type of patterns: sequential patterns with the negative conclusions is proposed in the paper. They denote that a certain set of items does not occur after a regul...
Przemyslaw Kazienko