On knowledge structures reduction

被引：3

作者：

Snasel, Vaclav ^{[1
]}

Polovincak, Martin ^{[1
]}

Dahwa, Hussam M. ^{[1
]}

Horak, Zdenek ^{[1
]}

机构：

[1] Tech Univ Ostrava, Ostrava, Czech Republic

来源：

SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT APPLICATIONS, PROCEEDINGS | 2008年

关键词：

D O I：

10.1109/CISIM.2008.65

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Matrix reduction and formal concept analysis are two complementary mathematical tools for data analysis. In this paper we study the reduction of the concept lattices and implication bases based on matrix reduction and propose two kinds of reduction methods for the above concept lattices. We analyse the benefits which we obtain by using several methods of matrix factorisation to reduce the dimension of input data.

引用

页码：33 / 37

页数：5

共 17 条

[1] Scalability in formal concept analysis
Cole, R
Eklund, PW
[J]. COMPUTATIONAL INTELLIGENCE, 1999, 15 (01) : 11 - 27
[2] DEERWESTER S, 1990, J AM SOC INFORM SCI, V41, P391, DOI 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO
[3] 2-9
[4] Eldén L, 2007, FUND ALGORITHMS, V4, pIX, DOI 10.1137/1.9780898718867
[5] GANTER B, 1999, MATH SCI HUMAINES, V95
[6] Guigues J.-L., 1986, Mathematiques et sciences humaines, V95, P5
[7] HORAK Z, 2007, P FUZZ IEEE 2007 16, P936
[8] Húsek D, 2007, LECT NOTES COMPUT SC, V4815, P235
[9] KAREN S, 2005, INFORM RETRIEVAL, V8, P285
[10] Learning the parts of objects by non-negative matrix factorization
Lee, DD
Seung, HS
[J]. NATURE, 1999, 401 (6755) : 788 - 791

← 1 2 →