SPADE: An Efficient Algorithm for Mining Frequent Sequences

ISSN： 0885-6125

Source： Machine Learning, Vol.42, Iss.1-2, 2001-01, pp. : 31-60

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient Algorithms for Mining and Incremental Update of Maximal Frequent Sequences

By Kao Ben Zhang Minghua Yip Chi-Lap Cheung David Fayyad Usama

Data Mining and Knowledge Discovery, Vol. 10, Iss. 2, 2005-03 ,pp. : 87-116

Springer Publishing Company

Access to resources Recommend Favorite

GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets

By Gouda Karam Zaki Mohammed

Data Mining and Knowledge Discovery, Vol. 11, Iss. 3, 2005-11 ,pp. : 223-242

Springer Publishing Company

Access to resources Recommend Favorite

An efficient algorithm for mining frequent closed itemsets in dynamic transaction databases

By Wang Ruili Xu Luofeng Marsland Stephen Rayudu Ramesh

International Journal of Intelligent Systems Technologies and Applications, Vol. 4, Iss. 3-4, 2008-02 ,pp. : 313-326

Inderscience Publishers

Access to resources Recommend Favorite

A time- and memory-efficient frequent itemset discovering algorithm for association rule mining

By Ivancsy Renata Vajk Istvan

International Journal of Computer Applications in Technology, Vol. 27, Iss. 4, 2007-01 ,pp. : 270-280

Inderscience Publishers

Access to resources Recommend Favorite

DBC: a condensed representation of frequent patterns for efficient mining

By Bykowski A. Rigotti C.

Information Systems, Vol. 28, Iss. 8, 2003-12 ,pp. : 949-977

Elsevier

Access to resources Recommend Favorite