New models for the clustering of large databases through a hierarchical paradigm

The recovery of information from large databases based on similarity approach supposes a high computational cost -when the process is carried out comparing each one of the records with the search pattern. If the database records store some data structure representing the information of the problem d...

Full description

Saved in:
Bibliographic Details
Main Authors: Ruiz, I.L., Garcia, G.C., Cuadrado, M.U., Gomez-Nieto, M.A.
Format: Conference Proceeding
Language:English
Subjects:
Buildings
Computational efficiency
Data mining
Data structures
Graph theory
Indexes
Numerical analysis
Optical recording
Proposals
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The recovery of information from large databases based on similarity approach supposes a high computational cost -when the process is carried out comparing each one of the records with the search pattern. If the database records store some data structure representing the information of the problem domain by means of a graph it is possible to classify these records using a hierarchical model which considers the structural basic elements of the graphs and diminishes the computational cost of the recovery process considerably. In this paper we propose a classification model based on structural elements (cycles and chains) for large and medium databases.
ISSN:2164-7143
2164-7151
DOI:10.1109/ISDA.2005.72