Generalized disjunction-free representation of frequent patterns with negation

ISSN： 1362-3079

Source： Journal of Experimental & Theoretical Artificial Intelligence, Vol.17, Iss.1-2, 2005-01, pp. : 63-82

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

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

Explicit Representation of Concept Negation

By Puget J-F.

Machine Learning, Vol. 14, Iss. 2, 1994-02 ,pp. : 233-247

Springer Publishing Company

Access to resources Recommend Favorite

Meta itemset: a new concise representation of frequent itemset

By Song Wei

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 21, Iss. 4, 2009-12 ,pp. : 259-272

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

By Han Jiawei Pei Jian Yin Yiwen Mao Runying

Data Mining and Knowledge Discovery, Vol. 8, Iss. 1, 2004-01 ,pp. : 53-87

Springer Publishing Company

Access to resources Recommend Favorite

Finding Frequent Patterns in a Large Sparse Graph^*

By Kuramochi Michihiro Karypis George

Data Mining and Knowledge Discovery, Vol. 11, Iss. 3, 2005-11 ,pp. : 243-271

Springer Publishing Company

Access to resources Recommend Favorite