Skip to main content
Article thumbnail
Location of Repository


By Aurora Pons-porrata, José Ruiz-shulcloper and José F. Martínez-trinidad


In this paper we introduce a new conceptual algorithm for the conceptual analysis of a mixed incomplete data set. This is a Logical Combinatorial Pattern Recognition (LCPR) based tool for the conceptual structuralization of spaces. Starting from the limitations of the elaborated conceptual algorithms, our Laboratories are working in the application of the methods, the techniques and in general, the philosophy of the Logical Combinatorial Pattern Recognition with the task to improve those limitations. An extension of the Michalski’s concept of l-complex for any similarity measure, a generalization operator for symbolic variables and an extension of the Michalski’s Refunion operator are introduced. Finally, the performance of the RGC algorithm is analyzed. A comparison with several known conceptual algorithms is presented

Topics: Conceptual algorithms, Logical Combinatory Pattern Recognition, Refunion operator
Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.