International Journal of Man-Machine Studies
Efficient mining of association rules using closed itemset lattices
Information Systems
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Experiments with Incremental Concept Formation: UNIMEM
Machine Learning
Knowledge Acquisition Via Incremental Conceptual Clustering
Machine Learning
Partitioning Large Data to Scale up Lattice-Based Algorithm
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Concept Data Analysis: Theory and Applications
Concept Data Analysis: Theory and Applications
Hierarchies generated for data represented by fuzzy ternary relations
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
Lattices for 3-dimensional fuzzy data generated by fuzzy Galois connections
WSEAS Transactions on Systems and Control
Hi-index | 0.01 |
Both cluster analysis and association analysis are important tasks of data mining. In some applications, we need both cluster analysis and association analysis for the same data. Each task takes very high time cost to deal with large data. In order to reduce expensive cost of the two mining tasks for large data set of transactions, we propose one strategy to unify cluster analysis and association analysis. This paper presents a new core algorithm of the strategy for analysis of large and high-dimensional data as well. The experimental results show the efficiency of this algorithm.