Sciweavers

732 search results - page 32 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 8 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
13 years 7 months ago
Mining Regular Patterns in Data Streams
Discovering interesting patterns from high-speed data streams is a challenging problem in data mining. Recently, the support metric-based frequent pattern mining from data stream h...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
IDEAS
2007
IEEE
138views Database» more  IDEAS 2007»
14 years 2 months ago
On Transversal Hypergraph Enumeration in Mining Sequential Patterns
The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this ...
Dong (Haoyuan) Li, Anne Laurent, Maguelonne Teisse...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
WWW
2008
ACM
14 years 8 months ago
Substructure similarity measurement in chinese recipes
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
Liping Wang, Qing Li, Na Li, Guozhu Dong, Yu Yang