[1]MAO Hua,LIU Yichao.An algorithm for concept lattice construction based on maximum cycles of weight values[J].CAAI Transactions on Intelligent Systems,2016,11(4):519-525.[doi:10.11992/tis.201606006]
Copy

An algorithm for concept lattice construction based on maximum cycles of weight values

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 11 Number of periods: 2016 4 Page number: 519-525 Column: 学术论文—知识工程 Public date: 2016-07-25
Title:
An algorithm for concept lattice construction based on maximum cycles of weight values
Author(s):
MAO Hua;  LIU Yichao
School of Mathematics and Information Science, Hebei University, Baoding 071002, China
Keywords:
formal context; concept lattice; concept; weight value; maximum cycle; attributes topology; data processing
CLC:
TP18
DOI:
10.11992/tis.201606006
Abstract:
As an effective tool for knowledge discovery and data processing, the concept lattice has been widely applied in many fields. Searching all concepts in a formal context is a basic problem for research into concept lattice theory. On the basis of attribute topology and combined with the idea of graph theory, an algorithm to construct a concept lattice in a fixed formal context is given. The process is as follows:firstly, a weakened attribute topology was built up; then, by applying the method of searching the maximum cycle with a weight in the above weakened attribute topology, all of the formal context concepts were obtained; finally the concept lattice was established. Subsequent analysis illustrated that the algorithm can reduce complexity compared with some existing algorithms. In addition, using an example, the accuracy and validity of the algorithm was verified. The result presents a useful idea and method for knowledge acquisition.
References:
[1] WILLE R. Restructuring lattice theory:an approach based on hierarchies of concepts[M]//RIVAL I. Ordered Sets. Dordrecht:Springer, 1982.
[2] BELOHLAVEK R, SIGMUND E, ZACPAL J. Evaluation of IPAQ questionnaires supported by formal concept analysis[J]. Information sciences, 2011, 181(10):1774-1786.
[3] NGUYEN T T, HUI S C, CHANG Kuiyu. A lattice-based approach for mathematical search using formal concept analysis[J]. Expert systems with applications, 2012, 39(5):5820-5828.
[4] 王旭杨, 李明. 基于概念格的数据挖掘方法研究[J]. 计算机应用, 2005, 25(4):827-829. WANG Xuyang, LI Ming. Method of data mining based on concept lattice[J]. Computer applications, 2005, 25(4):827-829.
[5] SIFF M, REPS T. Identifying modules via concept analysis[C]//Proceedings of International Conference on Software Maintenance. Washington, DC, USA:IEEE Computer Society, 1997:170-179.
[6] FERJANI F, ELLOUMI S, JAOUA A, et al. Formal context coverage based on isolated labels:an efficient solution for text feature extraction[J]. Information sciences, 2012, 188:198-214.
[7] 邓君, 马晓君, 张巨峰, 等. 基于概念格的实体档案馆用户行为研究[J]. 图书情报工作, 2014, 58(12):109-117. DENG Jun, MA Xiaojun, ZHANG Jufeng, et al. Study on entity archives’ user behavior based on concept lattice[J]. Library and information service, 2014, 58(12):109-117.
[8] 张晓, 龙伟, 卢斌. 基于概念格的关联规则在排产管理的应用[J]. 计算机工程与应用, 2014, 50(9):264-270. v ZHANG Xiao, LONG Wei, LU Bin. Application of association rule based on concept lattice for scheduling management[J]. Computer engineering and applications, 2014, 50(9):264-270.
[9] 张涛, 任宏雷. 形式背景的属性拓扑表示[J]. 小型微型计算机系统, 2014, 35(3):590-593. ZHANG Tao, REN Honglei. Attribute topology of formal context[J]. Journal of Chinese computer systems, 2014, 35(3):590-593.
[10] BERRY A, SIGAYRET A. Representing a concept lattice by a graph[J]. Discrete applied mathematics, 2004, 144(1/2):27-42.
[11] 李立峰, 刘三阳, 罗清君. 弦二部图的概念格表示[J]. 电子学报, 2013, 41(7):1384-1388. LI Lifeng, LIU Sanyang, LUO Qingjun. Representing chordal bipartite graph using concept lattice theory[J]. Acta electronica sinica, 2013, 41(7):1384-1388.
[12] DAVEY B A, PRIESTLEY H A. Introduction to lattices and order[M]. 2nd ed. New York:Cambridge University Press, 2002:66-69.
[13] 王树禾. 图论[M]. 北京:科学出版社, 2009.
[14] ZHANG Tao, REN Honglei, WANG Xiaomin. A calculation of formal concept by attribute topology[J]. ICIC express letters part B:applications, 2013, 4(3):793-800.
[15] 方嘉琳. 集合论[M]. 长春:吉林人民出版社, 1982.
Similar References:

Memo

-

Last Update: 1900-01-01

Copyright © CAAI Transactions on Intelligent Systems