Mining non-redundant diverse patterns: an information theoretic perspective

Chaofeng SHA1,Jian GONG1,Aoying ZHOU2,

Front. Comput. Sci. ›› 2010, Vol. 4 ›› Issue (1) : 89-99.

PDF(284 KB)
Front. Comput. Sci. All Journals
PDF(284 KB)
Front. Comput. Sci. ›› 2010, Vol. 4 ›› Issue (1) : 89-99. DOI: 10.1007/s11704-009-0072-9
Research articles

Mining non-redundant diverse patterns: an information theoretic perspective

  • Chaofeng SHA1,Jian GONG1,Aoying ZHOU2,
Author information +
History +

Abstract

The discovery of diversity patterns from binary data is an important data mining task. In this paper, we propose the problem of mining highly diverse patterns called non-redundant diversity patterns (NDPs). In this framework, entropy is adopted to measure the diversity of itemsets. In addition, an algorithm called NDP miner is proposed to exploit both monotone properties of entropy diversity measure and pruning power for the efficient discovery of non-redundant diversity patterns. Finally, our experimental results are given to show that the NDP miner can efficiently identify non-redundant diversity patterns.

Keywords

diverse pattern / entropy / depth-first search

Cite this article

Download citation ▾
Chaofeng SHA, Jian GONG, Aoying ZHOU,. Mining non-redundant diverse patterns: an information theoretic perspective. Front. Comput. Sci., 2010, 4(1): 89‒99 https://doi.org/10.1007/s11704-009-0072-9
This is a preview of subscription content, contact us for subscripton.
AI Summary AI Mindmap
PDF(284 KB)

Supplementary files

Highlights (271 KB)

Accesses

Citations

1

Altmetric

Detail

Sections
Recommended

/