What question did this study set out to answer?

The aim is to present efficient algorithms for managing and mining large-scale rich-media data effectively.

October 19, 2009

Parallel algorithms for mining large-scale rich-media data

ECEdward Yi ChangNational Yang Ming Chiao Tung University HBHongjie BaiBeijing University of Technology KZKaihua ZhuGoogle (United States)

Key Points

The aim is to present efficient algorithms for managing and mining large-scale rich-media data effectively.
Introduced parallel implementations of Spectral Clustering (PSC), FP-Growth (PFP), Latent Dirichlet Allocation (PLDA), and Support Vector Machines (PSVM).
Discussed challenges in processing large-scale media data.
Proposed parallel algorithms enhance the efficiency of mining large datasets.
Addressed scalability issues faced by traditional mining approaches in real-world scenarios.

Abstract

The amount of online photos and videos is now at the scale of tens of billions. To organize, index, and retrieve these large-scale rich-media data, a system must employ scalable data management and mining algorithms. The research community needs to consider solving large scale problems rather than solving problems with small datasets that do not reflect real life scenarios. This tutorial introduces key challenges in large-scale rich-media data mining, and presents parallel algorithms for tackling such challenges. We present our parallel implementations of Spectral Clustering (PSC), FP-Growth (PFP), Latent Dirichlet Allocation (PLDA), and Support Vector Machines (PSVM).

Ask AI

Helpful

Bookmark

View Full Paper