Mapreduce-based closed frequent itemset mining with efficient redundancy filtering

SQ Wang, YB Yang, Y Gao, GP Chen… - 2012 IEEE 12th …, 2012 - ieeexplore.ieee.org
Mining closed frequent item set (CFI) plays a fundamental role in many real-world data
mining applications. However, memory requirement and computational cost have become …

Distributed data mining patterns and services: an architecture and experiments

E Cesario, D Talia - Concurrency and Computation: Practice …, 2012 - Wiley Online Library
Distributed data mining implements techniques for analyzing data on distributed computing
systems by exploiting data distribution and parallel algorithms. The grid is a computing …

System and method for content-based partitioning and mining

W Hu, C Lai - US Patent 8,126,911, 2012 - Google Patents
Methods and systems are provided for partitioning data of a database or data store into
several independent parts as part of a data mining process. The methods and systems use a …

[PDF][PDF] A search space reduced algorithm for mining frequent patterns

SJ Yen, CK Wang, LY Ouyang - Journal of information science …, 2012 - researchgate.net
Mining frequent patterns is to discover the groups of items appearing always together
excess of a user specified threshold. Many approaches have been proposed for mining …

Impact of I/O and execution scheduling strategies on large scale parallel data mining

N Benjamas, P Uthayopas - 2012 6th International Conference …, 2012 - ieeexplore.ieee.org
In the era of “Big Data”, there is an emerging need to process a massive data set using large
cluster system. Anyway, without the right strategies to handle the data, it is challenging to …

[PDF][PDF] Towards logical linked data compression

AK Joshi, P Hitzler, G Dong - Proceedings of the Joint Workshop on Large …, 2012 - Citeseer
Linked data has experienced accelerated growth in recent years. With the continuing
proliferation of structured data, demand for RDF compression is becoming increasingly …

A parallel association-rule mining algorithm

Z Wang, C Wang - Web Information Systems and Mining: International …, 2012 - Springer
Although the FP-Growth association-rule mining algorithm is more efficient than the Apriori
algorithm, it has two disadvantages. The first is that the FP-tree can become too large to be …

[PDF][PDF] 云环境下基于二进制编码聚类的并行频繁项集挖掘算法

刘博, 李云, 张晓斌, 徐杰 - 微电子学与计算机, 2012 - journalmc.com
本文提出了一种云环境下基于二进制编码的并行频繁项集挖掘算法, 利用一种特殊的二进制编码
的依赖度计量方法对原始数据集合进行编码转换及依赖度聚类, 然后将数据集分布部署在云环境 …

A distributed recommender system architecture

P Giannikopoulos, C Vassilakis - International journal of …, 2012 - inderscienceonline.com
In contemporary internet architectures, including server farms and blog aggregators, web log
data may be scattered among multiple cooperating peers. In order to perform content …

[PDF][PDF] Association rule mining with parallel frequent pattern growth algorithm on hadoop

J Wang, QH Dai, Y Zeng, DR Yang - Comput. Integr. Manuf. Syst, 2012 - ijssst.info
Although the association rules mining algorithm FP-Growth is more efficient than Apriori, it
has two disadvantages. The first one is that the FP-tree could be too large to be created in …