• DocumentCode
    3278307
  • Title

    A fast algorithm of concept generation

  • Author

    Xi Gong

  • Author_Institution
    Sch. of Software, Univ. of Sci. & Technol. Liaoning, Anshan, China
  • fYear
    2013
  • fDate
    23-25 May 2013
  • Firstpage
    938
  • Lastpage
    941
  • Abstract
    Concept generation is an important prerequisite for the formal concept analysis. With the increment of the formal context, time complexity of the existing algorithms increase rapidly. This paper presents a fast algorithm of concept generation. The algorithm needs the formal context to satisfy certain conditions. It uses a continuous matrix. It first determines the state of each row of the continuous matrix then generates concepts with each row as an object every time. It had been proved that the time complexity of the algorithm is O(n). It is significantly higher than the efficiency of the existing algorithms. This approach utilizes continuous matrix and provides new idea in formal concept analysis.
  • Keywords
    computational complexity; formal concept analysis; matrix algebra; concept generation; continuous matrix; formal concept analysis; time complexity; concept generation algorithm; formal concept analysis; matrix;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering and Service Science (ICSESS), 2013 4th IEEE International Conference on
  • Conference_Location
    Beijing
  • ISSN
    2327-0586
  • Print_ISBN
    978-1-4673-4997-0
  • Type

    conf

  • DOI
    10.1109/ICSESS.2013.6615460
  • Filename
    6615460