跳到主要导航 跳到搜索 跳到主要内容

HDminer: Efficient mining of high dimensional frequent closed patterns from dense data

  • Jianpeng Xu
  • , Shufan Ji*
  • *此作品的通讯作者
  • Michigan State University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Frequent closed pattern mining has been developed for decades, mostly on a two dimensional matrix. This paper addresses the problem of mining high dimensional frequent closed patterns (nFCPs) from dense binary dataset, where the dataset is represented by a high dimensional cube. As existing FP-tree or enumeration tree based algorithms do not suit for n-dimensional dense data, we are motivated to propose a novel algorithm called HDminer for nFCPs mining. HDminer employs effective search space partition and pruning strategies to enhance the mining efficiency. We have implemented HDminer, and the performance studies on synthetic data and real microarray data show its superiority over existing algorithms.

源语言英语
主期刊名Proceedings - 14th IEEE International Conference on Data Mining Workshops, ICDMW 2014
编辑Zhi-Hua Zhou, Wei Wang, Ravi Kumar, Hannu Toivonen, Jian Pei, Joshua Zhexue Huang, Xindong Wu
出版商IEEE Computer Society
1061-1067
页数7
版本January
ISBN(电子版)9781479942749
DOI
出版状态已出版 - 26 1月 2015
活动14th IEEE International Conference on Data Mining Workshops, ICDMW 2014 - Shenzhen, 中国
期限: 14 12月 2014 → …

丛书

姓名IEEE International Conference on Data Mining Workshops, ICDMW
编号January
2015-January
ISSN(印刷版)2375-9232
ISSN(电子版)2375-9259

会议

会议14th IEEE International Conference on Data Mining Workshops, ICDMW 2014
国家/地区中国
Shenzhen
时期14/12/14 → …

学术指纹

探究 'HDminer: Efficient mining of high dimensional frequent closed patterns from dense data' 的科研主题。它们共同构成独一无二的学术指纹。

引用此