메뉴 건너뛰기
Information Retrieval
Volumn 15, Issue 2, 2012, Pages 151-156
On complexity reduction of concept lattices: Three counterexamples
Author keywords

Complexity reduction; Concept lattice; Information retrieval; Lattice theory
Indexed keywords

EID: 84858793536     PISSN: 13864564     EISSN: 15737659     Source Type: Journal    
DOI: 10.1007/s10791-011-9175-7     Document Type: Article
Times cited : (5)
References (4)
  • 1
    • 70449531469 scopus 로고    scopus 로고
    • Concept lattice reduction using fuzzy K-means clustering
    • Aswani Kumar, C., Srinivas, S. (2010). Concept lattice reduction using fuzzy K-means clustering. Expert systems with applications, 37(3), 2696-2704.
    • (2010) Expert Systems with Applications , vol.37 , Issue.3 , pp. 2696-2704
    • Aswani Kumar, C.1    Srinivas, S.2
  • 2
    • 17144417728 scopus 로고    scopus 로고
    • Complexity reduction in lattice-based information retrieval
    • Cheung, K. S., Vogel, D. (2005). Complexity reduction in lattice-based information retrieval. Information retrieval, 8(2), 285-299.
    • (2005) Information Retrieval , vol.8 , Issue.2 , pp. 285-299
    • Cheung, K.S.1    Vogel, D.2
  • 4
    • 0000398336 scopus 로고
    • Restructuring lattice theory: An approach based on hierarchies of concepts
    • I. Rival (Ed.), Dordrecht: Reidel
    • Wille, R. (1982). Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets. Dordrecht: Reidel, pp. 445-470.
    • (1982) Ordered Sets , pp. 445-470
    • Wille, R.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.