Bit-Table Based Biclustering and Frequent Closed Itemset Mining in High-Dimensional Binary Data
During the last decade various algorithms have been developed and proposed for discovering overlapping clusters in high-dimensional data. The two most prominent application fields in this research, proposed independently, are frequent itemset mining (developed for market basket data) and biclusterin...
Saved in:
Main Authors: | András Király, Attila Gyenesei, János Abonyi |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2014/870406 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
DISCOVERING CONFUSING FREQUENT ITEMSETS
by: Huỳnh Thành Lộc
Published: (2018-07-01) -
MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST
by: Phan Thành Huấn, et al.
Published: (2018-07-01) -
Personalized Privacy-Preserving Frequent Itemset Mining Using Randomized Response
by: Chongjing Sun, et al.
Published: (2014-01-01) -
An Incremental Interesting Maximal Frequent Itemset Mining Based on FP-Growth Algorithm
by: Hussein A. Alsaeedi, et al.
Published: (2022-01-01) -
An efficient and resilience linear prefix approach for mining maximal frequent itemset using clustering
by: M. Sinthuja, et al.
Published: (2025-03-01)