Parallel co-clustering with augmented matrices algorithm with map-reduce

Meng Lun Wu, Chia Hui Chang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Co-clustering with augmented matrices (CCAM) [11] is a two-way clustering algorithm that considers dyadic data (e.g., two types of objects) and other correlation data (e.g., objects and their attributes) simultaneously. CCAM was developed to outperform other state-of-the-art algorithms in certain real-world recommendation tasks [12]. However, incorporating multiple correlation data involves a heavy scalability demand. In this paper, we show how the parallel co-clustering with augmented matrices (PCCAM) algorithm can be designed on the Map-Reduce framework. The experimental work shows that the input format, the number of blocks, and the number of reducers can greatly affect the overall performance.

Original languageEnglish
Title of host publicationData Warehousing and Knowledge Discovery - 16th International Conference, DaWaK 2014, Proceedings
PublisherSpringer Verlag
Pages183-194
Number of pages12
ISBN (Print)9783319101590
DOIs
StatePublished - 2014
Event16th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2014 - Munich, Germany
Duration: 2 Sep 20144 Sep 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8646 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2014
Country/TerritoryGermany
CityMunich
Period2/09/144/09/14

Keywords

  • Co-clustering
  • Hadoop
  • Map-Reduce
  • recommender system

Fingerprint

Dive into the research topics of 'Parallel co-clustering with augmented matrices algorithm with map-reduce'. Together they form a unique fingerprint.

Cite this