Mining maximal hyperclique pattern: a hybrid search strategy

DOI10.1016/j.ins.2006.07.029zbMath1142.68513OpenAlexW2062835941MaRDI QIDQ867645

Yaochun Huang, Zhongnan Zhang, Hui Xiong, Weili Wu, Ping Deng

Publication date: 16 February 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2006.07.029

zbMATH Keywords

data miningassociation ruleshyperclique patterns

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Mining frequent trajectory patterns in spatial-temporal databases ⋮ An order-clique-based approach for mining maximal co-locations

Cites Work

• A tree projection algorithm for generation of frequent item sets

This page was built for publication: Mining maximal hyperclique pattern: a hybrid search strategy