Revisiting pattern structures for structured attribute sets

Mehwish Alam, Aleksey Buzmakov, Amedeo Napoli, Alibek Sailanbayev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

In this paper, we revisit an original proposition on pattern structures for structured sets of attributes. There are several reasons for carrying out this kind of research work. The original proposition does not give many details on the whole framework, and especially on the possible ways of implementing the similarity operation. There exists an alternative definition without any reference to pattern structures, and we would like to make a parallel between two points of view. Moreover we discuss an efficient implementation of the intersection operation in the corresponding pattern structure. Finally, we discovered that pattern structures for structured attribute sets are very well adapted to the classification and the analysis of RDF data. We terminate the paper by an experimental section where it is shown that the provided implementation of pattern structures for structured attribute sets is quite efficient.

Original languageEnglish
Title of host publication12th International Conference on Concept Lattices and Their Applications, CLA 2015
PublisherCEUR-WS
Pages241-252
Number of pages12
Volume1466
ISBN (Electronic)9782954494807
Publication statusPublished - 2015
Externally publishedYes
Event12th International Conference on Concept Lattices and Their Applications, CLA 2015 - Clermont-Ferrand, France
Duration: Oct 13 2015Oct 16 2015

Conference

Conference12th International Conference on Concept Lattices and Their Applications, CLA 2015
CountryFrance
CityClermont-Ferrand
Period10/13/1510/16/15

Keywords

  • Formal concept analysis
  • Least common ancestor
  • Pattern structures
  • Range minimum query
  • Structured attribute sets

ASJC Scopus subject areas

  • Computer Science(all)

Cite this