Keszler, Anita and Kovács, Levente Attila and Szirányi, Tamás (2012) The Appearance of the Giant Component in Descriptor Graphs and Its Application for Descriptor Selection. In: Lecture Notes in Computer Science, 2012-09-17 - 2012-09-20, Roma, Olaszország. 10.1007/978-3-642-33247-0_9

Text 9783642332470_9null - Published Version Restricted to Registered users only Download (42kB) | Request a copy

Abstract

The paper presents a random graph based analysis approach for evaluating descriptors based on pairwise distance distributions on real data. Starting from the Erdős-Rényi model on uniform random graphs, the paper presents results of investigating random geometric graph behaviour in relation with the appearance of the giant component as a basis for choosing descriptors based on their clustering properties. Experimental results prove the existence of the giant component in such graphs, and based on the evaluation of their behaviour the graphs, the corresponding descriptors are compared, and validated in proof-of-concept retrieval tests. The goal is to build an evaluation framework where descriptors and their combinations can be analysed for automatic feature selection.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Distributed Events Analysis Research Laboratory
Depositing User:	EPrints Admin
Date Deposited:	12 Dec 2012 08:39
Last Modified:	05 Feb 2014 12:27
URI:	https://eprints.sztaki.hu/id/eprint/6530

Update Item