Mining maximal hyperclique pattern: a hybrid search strategy

DOI10.1016/J.INS.2006.07.029MaRDI QIDQ867645zbMATH OpenOpenAlexFDO

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

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

association rulesdata mininghyperclique 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)

Recommendations

• Fast unified mining of hyperclique patterns and maximal hyperclique patterns
• On the strength of hyperclique patterns for text categorization
• scientific article; zbMATH DE number 2112477
• scientific article; zbMATH DE number 5669640
• Frequent Hypergraph Mining

Cites work

• A tree projection algorithm for generation of frequent item sets

Cited in

(5)

• On the strength of hyperclique patterns for text categorization
• Mining frequent trajectory patterns in spatial-temporal databases
• Finding top-N colossal patterns based on clique search with dynamic update of graph
• Fast unified mining of hyperclique patterns and maximal hyperclique patterns
• An order-clique-based approach for mining maximal co-locations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867645)