Paper
22 May 2014 Analysis of large-scale distributed knowledge sources via autonomous cooperative graph mining
Georgiy Levchuk, Andres Ortiz, Xifeng Yan
Author Affiliations +
Abstract
In this paper, we present a model for processing distributed relational data across multiple autonomous heterogeneous computing resources in environments with limited control, resource failures, and communication bottlenecks. Our model exploits dependencies in the data to enable collaborative distributed querying in noisy data. The collaboration policy for computational resources is efficiently constructed from the belief propagation algorithm. To scale to large data sizes, we employ a combination of priority-based filtering, incremental processing, and communication compression techniques. Our solution achieved high accuracy of analysis results and orders of magnitude improvements in computation time compared to the centralized graph matching solution.
© (2014) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Georgiy Levchuk, Andres Ortiz, and Xifeng Yan "Analysis of large-scale distributed knowledge sources via autonomous cooperative graph mining", Proc. SPIE 9119, Machine Intelligence and Bio-inspired Computation: Theory and Applications VIII, 91190K (22 May 2014); https://doi.org/10.1117/12.2050836
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data modeling

Data communications

Data processing

Data analysis

Mining

Analytical research

Detection and tracking algorithms

Back to Top