کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
535594 870357 2015 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Building k-edge-connected neighborhood graph for distance-based data projection
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Building k-edge-connected neighborhood graph for distance-based data projection
چکیده انگلیسی

Neighborhood graph construction is the first step of data projection based on geodesic distances. This paper presents an approach for constructing a k-edge-connected neighborhood graph. The approach works by applying a greedy algorithm to add edges in a non-decreasing order of edge length to the neighborhood graph if end vertices of each edge are not yet k-edge-connected on the graph. The approach is applicable to a wide range of data including data distributed in clusters. It is compared with other approaches through experiments.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition Letters - Volume 26, Issue 13, 1 October 2005, Pages 2015–2021
نویسندگان
,