• Title/Summary/Keyword: lattices

Search Result 292, Processing Time 0.021 seconds

Design of an Efficient Keyword-based Retrieval System Using Concept lattice (개념 망을 이용한 키워드 기반의 효율적인 정보 검색 시스템 설계)

  • Ma, Jin;Jeon, In ho;Choi, Young keun
    • Journal of Internet Computing and Services
    • /
    • v.16 no.3
    • /
    • pp.43-57
    • /
    • 2015
  • In this thesis was conducted to propose a method for efficient information retrieval using concept lattices. Since this thesis designed a new system based on ordinary concept lattices, it has the same approach method as ontology, but this thesis proposes new concept lattices to be used by establishing collaborative relations between objects and concepts that users are likely to search information more efficiently. The system suggested by this thesis can be summarized as below. Firstly, this system leads to a collaborative search by using Three kinds of concepts, such as keyword concept lattices, which focus on input key words, expert concept lattices recommended by experts and theme concept lattices, and based on these 3 concept lattices, it will help users search information they want more efficiently. Besides, as the expert concept and the keyword concept become combined, further providing users with the frequency of keyword and the frequency of category, this system can function to recommend key words related to search words entered by users. Another function of this system is to inform users of key words and categories used in users' interested themes by using the theme concept lattices. Secondly, when there is not keyword entered by a user, it is possible for users to achieve the goal of search through the secondary search when this system provides them with key words related to the input keyword. Thirdly, since most of the information is managed while being dispersed, such dispersed and managed information not only has different expression methods but changes as time goes. Accordingly, By using XMDR for efficient data access and integration of distributed information, this thesis proposes a new technique and retrieval system to integrate dispersed data.

A NOTE ON WEAKLY PATH-CONNECTED ORTHOMODULAR LATTICES

  • Park, Eun-Soon
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.3
    • /
    • pp.513-519
    • /
    • 1997
  • We show that each orthomodular lattice containing only atomic nonpath-connected blocks is a full subalgebra of an irreducible path-connected orthomodular lattice and there is a path-connected orthomodualr lattice L containing a weakly path-connected full subalgebra C(x) for some element x in L.

  • PDF

A NOTE ON FINITE CONDITIONS OF ORTHOMODULAR LATTICES

  • Park, Eun-Soon
    • Communications of the Korean Mathematical Society
    • /
    • v.14 no.1
    • /
    • pp.31-37
    • /
    • 1999
  • We prove the following: every chain-finite OML is path-connected; every finite block of an OML L is path-connected with at least one other block in L; every OML with unifromly finite sites is path-connected.

  • PDF

LATTICES OF FUZZY SUBGROUPOIDS, FUZZY SUBMONOIDS AND FUZZY SUBGROUPS

  • Kim, Jae-Gyeom
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1995.10b
    • /
    • pp.331-334
    • /
    • 1995
  • We redefine the sup-min product of fuzzy subsets and discuss the redefined sup-min products of fuzzy subgroupoids, fuzzy submonoids and fuzzy subgroups. And we study lattice structures of the lattices of fuzzy subgroupoids, fuzzy submonoids and fuzzy subgroups.

  • PDF

ON GENERALIZED SYMMETRIC BI-f-DERIVATIONS OF LATTICES

  • Kim, Kyung Ho
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.125-136
    • /
    • 2022
  • The goal of this paper is to introduce the notion of generalized symmetric bi-f-derivations in lattices and to study some properties of generalized symmetric f-derivations of lattice. Moreover, we consider generalized isotone symmetric bi-f-derivations and fixed sets related to generalized symmetric bi-f-derivations.