Share Email Print

Proceedings Paper

Analysis of large-scale distributed knowledge sources via autonomous cooperative graph mining
Author(s): Georgiy Levchuk; Andres Ortiz; Xifeng Yan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 22 May 2014
PDF: 14 pages
Proc. SPIE 9119, Machine Intelligence and Bio-inspired Computation: Theory and Applications VIII, 91190K (22 May 2014); doi: 10.1117/12.2050836
Show Author Affiliations
Georgiy Levchuk, Aptima, Inc. (United States)
Andres Ortiz, Aptima, Inc. (United States)
Xifeng Yan, Aptima, Inc. (United States)

Published in SPIE Proceedings Vol. 9119:
Machine Intelligence and Bio-inspired Computation: Theory and Applications VIII
Misty Blowers; Jonathan Williams, Editor(s)

© SPIE. Terms of Use
Back to Top