Mining maximal hyperclique pattern: A hybrid search strategy

  • Authors:

  • Yaochun Huang;Hui Xiong;Weili Wu;Ping Deng;Zhongnan Zhang

  • Affiliations:

  • The University of Texas at Dallas, Department of Computer Science, P.O. Box 830688, MS EC31, Richardson, TX 75083, United States;Rutgers University, MSIS Department, 180 University Avenue, Newark, NJ 07102, United States;The University of Texas at Dallas, Department of Computer Science, P.O. Box 830688, MS EC31, Richardson, TX 75083, United States;The University of Texas at Dallas, Department of Computer Science, P.O. Box 830688, MS EC31, Richardson, TX 75083, United States;The University of Texas at Dallas, Department of Computer Science, P.O. Box 830688, MS EC31, Richardson, TX 75083, United States

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.07

Visualization

Abstract

A hyperclique pattern is a new type of association pattern that contains items which are highly affiliated with each other. Specifically, the presence of an item in one transaction strongly implies the presence of every other item that belongs to the same hyperclique pattern. In this paper, we present an algorithm for mining maximal hyperclique patterns, which specifies a more compact representation of hyperclique patterns and are desirable for many applications, such as pattern-based clustering. Our algorithm exploits key advantages of both the Depth First Search (DFS) strategy and the Breadth First Search (BFS) strategy. Indeed, we adapt the equivalence pruning method, one of the most efficient pruning methods of the DFS strategy, into the process of the BFS strategy. Our experimental results show that the performance of our algorithm can be orders of magnitude faster than standard maximal frequent pattern mining algorithms, particularly at low levels of support.