loading...
AFOPT Algorithm for Multi-Level Databases
Timisoara, Romania September 25-September 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.18Seventh International Symposium on Sy ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Robert Győrödi, University of Oradea
Cornelia Győrödi, University of Oradea
Mirela Pater, University of Oradea
Ovidiu Boc, University of Oradea
Zoltan David, University of Oradea
With the widespread computerization in business, government, and science, the efficient and effective discovery of interesting information from large databases becomes essential. Previous studies on data mining have been focused on the discovery of knowledge at single conceptual level, either at the primitive level or at a rather high conceptual level. This paper presents an algorithm based on the AFOPT algorithm for multi-level databases that uses the benefits of multileveled databases, by using the information gained by studying items from one concept level for the study of the items from the following concept levels.
Citation:
Robert Győrödi, Cornelia Győrödi, Mirela Pater, Ovidiu Boc, Zoltan David, "AFOPT Algorithm for Multi-Level Databases," synasc, pp.129-133, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.