Mathematical Problems in Engineering

Volume 2014 (2014), Article ID 836137, 9 pages

http://dx.doi.org/10.1155/2014/836137

Research Article

Attribute Extended Algorithm of Lattice-Valued Concept Lattice Based on Congener Formal Context

Li Yang¹ and Yang Xu²

¹School of Mathematics and Information Science, North China University of Water Resources and Electric Power, Zhengzhou 450046, China

²Intelligent Control Development Center, Southwest Jiaotong University, Chengdu 610031, China

Received 9 April 2014; Revised 9 June 2014; Accepted 11 June 2014; Published 30 June 2014

Academic Editor: Ker-Wei Yu

Copyright © 2014 Li Yang and Yang Xu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

This paper is the continuation of our research work about lattice-valued concept lattice based on lattice implication algebra. For a better application of lattice-valued concept lattice into data distributed storage and parallel processing, it is necessary to research attribute extended algorithm based on congener formal context. The definitions of attribute extended formal context and congener formal context are proposed. On condition that the extent set stays invariable when the new attribute is increased, the necessary and sufficient conditions of forming attribute values are researched. Based on these conditions, the algorithms of generating lattice-valued congener formal context and establishing concept lattice are given, by which we can provide a useful basis for union algorithm and constructing algorithm of lattice-valued concept lattices in distributed and parallel system.

1. Introduction

Concept lattice (also called formal concept analysis FCA) was proposed by Wille [1–3] in 1982, and its ideological core is constructing the binary relation between objects and attributes based on bivalent logic. Facing the massive fuzzy information existed in reality, fuzzy concept lattice has appeared [4–9], which is used to describe the fuzzy relation between objects and attributes. As a conceptual clustering method, concept lattices have been proved to benefit machine learning, information retrieval, and knowledge discovery.

Lattice-valued concept lattice talked about in this paper, which can be looked as another different kind of fuzzy concept lattice, is constructed on the structure of lattice implication algebra. Its key point different from the classical fuzzy concept lattice is that its values range is not general interval but a complete lattice structure, on which incomparability fuzzy information can be dealt with very well. This selection of lattice implication algebra has two advantages in contrast to general structure. The first computational process of lattice-valued formal concepts is closed under the fuzzy operation; the second complicated inference is avoided in setting up Galois connection of lattice-valued concept lattice. A large amount of research on lattice-valued concept lattice may be referred to [10–12]. While for lattice implication algebra, Xu et al. [13–15] proposed this concept by combining lattice and implication algebra in the 1980s in order to depict uncertainty information more factually.

With the rapid development of network technology, especial in the internet area, distributed storage and parallel processing of data are urgently needed. Distributed construction idea [16, 17] of concept lattice is firstly to form several subcontexts by dividing formal context and then construct the corresponding sublattices and get required concept lattice through combing these sublattices in the end; simply speaking, this idea is to construct concept lattice through combing several sublattices. Based on the horizontal and vertical resolution in formal contexts [18, 19], the union of multiple classical concept lattices includes the horizontal union and vertical union. And these two kinds of union algorithms have their respective preconditions required for formal contexts, which are the same objects sets for the horizontal union and the same attributes sets for the vertical union. However, for lattice-valued concept lattice, it is impossible to execute union operation on the formal contexts by only guaranteeing the same object sets or the same attribute sets, because the formal concepts derived from different formal contexts only with the same objects sets or the same attributes sets will belong to the different types. Therefore, if we want to combine, distributed, and construct the lattice-valued concept lattices, the different formal contexts should be guaranteed to possess both the same object sets and the same attribute sets. According to the three different situations that existed in formal contexts: the same object sets but the different attribute sets, the same attribute sets but the different object sets, the different object sets, and the different attributes, this paper mainly researches the required conditions with attribute increasing, under which the new established lattice-valued concept lattice has the invariable extent set—it is called as congener formal context and then obtains attribute extended algorithm of lattice-valued concept lattices based on congener formal context. The advantages of this algorithm are (i) it is helpful for multiple contexts with different attribute sets to have the same object sets and the same attribute sets and very convenient to execute union operation on multiple concept lattices; (ii) it is also used to improve the reduction ability of lattice-valued concept lattice [20–22], that is, based on the idea of this algorithm; a complicated lattice-valued concept lattice can be divided into several easier sublattices in order to realize reduction, and these sublattices can also be combined by the relevant union algorithm.

Based on these analyses, this paper puts forward attribute extended algorithm of lattice-valued concept lattice based on congener formal context. In Section 2, we give an overview of classical concept lattice and lattice implication algebra. In Section 3, the related works of lattice-valued concept lattice are briefly summarized. Successively, the definitions of attribute extended formal context and congener formal context are proposed in Section 4, where we show the relevant attribute extended judgment theorems based on congener formal context and give the generation algorithms of attribute extended formal context and lattice-valued formal concepts and make the algorithm analysis among the Bordat algorithm, extended algorithm and union algorithm, respectively. Concluding remarks are presented in Section 5.

2. Concept Lattice and Lattice Implication Algebra

In this section, we review briefly the classical concept lattices and lattice implication algebra and they are the foundations of constructing lattice-valued concept lattice.

Definition 1 (Birkhoff [1]). A partial ordered set (poset) is a set, in which a binary relation is defined, which satisfies the following conditions: for any , , ,

(1), for any (reflexive),(2) and implies (antisymmetry),(3) and implies (transitivity).

Definition 2 (Birkhoff [1]). Let be an arbitrary set, and let there be given two binary operations on , denoted by and . Then the structure is an algebraic structure with two binary operations. We call the structure a lattice provided that it satisfies the following properties:

(1)for any , and ;(2)for any , and ;(3)for any , and ;(4)for any , and .

Definition 3 (Ganter and Wille [3]). The formal context of classical concept lattice is defined as a set structure consisting of sets and and a binary relation . The elements of and are called objects and attributes, respectively, and the relationship is read: the object has the attribute . For a set of objects , is defined as the set of features shared by all the objects in ; that is,

Similarly, for , is defined as the set of objects that possess all the features in ; that is,

Definition 4 (Ganter and Wille [3]). A formal concept of the context is defined as a pair with , and , . The set is called the extent and the intent of the concept .

Definition 5 (Xu [13]). Let be a bounded lattice with an order-reversing involution , , and the greatest and the smallest element of , respectively, and let   be a mapping. If the following conditions hold for any :

(1),(2),(3),(4) implies ,(5),(6),(7),

then is called a lattice implication algebra (LIA).

Example 6 (Xu [13]). Let , , , , , , , the Hasse diagram of be defined as Figure 1, and its implication operation be defined as Table 1, then is a lattice implication algebra.

Table 1: Implication Operation of .

Figure 1: Hasse diagram of .

3. Lattice-Valued Concept Lattice

Lattice-valued concept lattice is the combination of classical concept lattice and lattice implication algebra and its ideological core is constructing lattice-valued relation between objects and attributes. It can be used to directly deal with incomparability fuzzy information and is totally different from classical fuzzy concept lattice. In this section, we study the definitions and theorems of lattice-valued concept lattice and give an example to illustrate it.

Definition 7. A four-tuple is called an -ary lattice-valued formal context, where is the set of objects, is the set of attributes, is an -ary lattice implication algebra, and is a fuzzy relation between and ; that is, .

Let be a nonempty objects set and an -ary lattice implication algebra. Denote the set of all the -fuzzy subsets on as , for any ,

then is a partial ordered set.

Let be a nonempty attributes set and an -ary lattice implication algebra. Denote the set of all the -fuzzy subsets on as , for any ,

then is a partial ordered set.

Theorem 8 (Yang and Xu [10]). Let be an -ary lattice-valued formal context and let be an -ary lattice implication algebra; define mappings , between and :

then for any , , is a Galois connection based on lattice implication algebra.

Theorem 9 (Yang and Xu [10]). Let be a lattice-valued formal context and the Galois connection, for any , ; there are the following properties:

(1), ;(2), .

Definition 10. Let be an -ary lattice-valued formal context; denote the set

and define

Theorem 11. Let be an -ary lattice-valued formal context; define the operations and on as

then is a complete lattice.

Proof. For any , , and by Theorem 9,

By Theorem 9, we can get

thus,

by Theorem 9,

it follows that ; obviously, is the lower bound of ; on the other hand, suppose that is a lower bound of ; then

that is,

so

can be proved similarly.

Thus, is a complete lattice.

Example 12. A lattice-valued formal context and its concept lattice based on the 4-ary lattice implication algebra are shown in Figures 2 and 3 and Tables 2 and 3.

In this Hasse diagram (see Figures 2 and 3), the fuzzy concepts are shown as follows:

 0#: , 1#: , 2#: , 3#: , 4#: , 5#: , 6#: , 7#: , 8#: , 9#: , 10#: , 11#: .

Table 2: Implication operator of .

Table 3: Lattice-valued formal context .

Figure 2: Hasse diagram of 4-ary lattice implication algebra .

Figure 3: Hasse diagram of lattice-valued concept lattice of .

4. Attribute Extended Algorithm of Lattice-Valued Concept Lattice

In the pioneering work of extended algorithm of concept lattice, many researchers put emphasis on reconstructing algorithm of concept lattice in adding attributes, and in this reconstructing process, the structure of original concept lattice generally may be changed. Up to now, there have not been any researches on extended algorithm of fuzzy concept lattice, because attribute increase will bound to be leading to the fundamental changes in the fuzzy concepts, and so will be bringing for the structure of lattice-valued concept lattice. In this section, we propose the definitions of attribute extended context and congener context. The relevant judgment theorems and algorithms are to be talked about.

4.1. Attribute Extended Theory of Lattice-Valued Fuzzy Concept Lattice

Definition 13. Let be an -ary lattice-valued formal context; the four-tuple is called an -ary lattice-valued attribute extended formal context of , where is a set of objects, is an extended set of attributes, is an -ary lattice implication algebra, and is the fuzzy relation of and ; that is, and , , satisfying

For the above formal contexts, there are relevant concept lattices that can be denoted by , , respectively. And denote the set

Definition 14. Let be an -ary lattice-valued formal context and an -ary lattice-valued attribute extended forma context. is called congener formal context of if

accordingly, is called congener concept lattice of .

For an -ary lattice-valued attribute extended formal context , is a Galois connection between and , , , and ; denote

Theorem 15. Let be an -ary lattice-valued attribute extended formal context of , , , ,and ; then is the congener formal context of if and only if

Proof. Consider that , ; that is, ; , ; that is, ; by Definition 14, is the congener formal context of .

Theorem 16. Let be an -ary lattice-valued attribute extended formal context of , , ,and ; then is the congener formal context of if and only if

Proof. By Theorem 15, is the congener formal context of :

Corollary 17. Let be an -ary lattice-valued attribute extended formal context of , , , and ; then is the congener formal context of , if , , such that

Theorem 18. Let be an -ary lattice-valued attribute extended formal context of , , , and ; then is the congener fuzzy context of if  , , such that

Proof. By Theorem 16,

so is the congener fuzzy context of .

Corollary 19. Let an -ary lattice-valued attribute extended formal context of , , , and ; then is the congener formal context of if , , such that

Theorem 20. Let be an -ary lattice-valued attribute extended formal context of , , , and ; then is the congener formal context of if

Proof. By Theorem 16,

so is the congener fuzzy context of .

4.2. Attribute Extended Algorithm of Lattice-Valued Concept Lattice

For general fuzzy concept lattice which is constructed on the interval , attribute effective increased will inevitably change the number of fuzzy concepts and the structure of fuzzy concept lattice. But, for lattice-valued concept lattice, attribute conditional increased which is researched in this paper and will not change the number of formal concepts and the structure of concept lattice. We explain this through Algorithms 1 and 2.

Input: the -ary lattice-valued formal context , let

Output: the -ary lattice-valued attribute extended formal context

Begin

    while () do

     Calculate the attribute values    of each attribute  

     for each  ,   do

            if      then

            else

            endif;

            for each  , ,   do

                if      then

                else

                endif;

                for     do

                    if      then

                    else

                    endif;

                endif

            endfor;

     endfor;

end

Algorithm 1: Generation algorithm of .

Input: the -ary lattice-valued concept lattice

Output: the -ary lattice-valued attribute extended concept lattice

Begin

    while () do

     Calculate the formal concepts of

     for each  , denote  ,

            do

            if   , s.t.,   then

            else

            endif;

                if   , s.t.,   then

                else

                endif;

                    if   , s.t.,

                    then

                    else

                    endif;

                endif

            endif;

     endfor;

end

Algorithm 2: Generation algorithm of formal concepts.

Example 21. For Table 3, a 4-ary lattice-valued formal context , we can compute its congener formal context as Table 4.

In this formal context , , , and it follows that , , . According to the theorems and algorithms of attribute increased, the formal concepts of are directly derived from the relevant formal concepts of as follows:

 0#: , 1#: , 2#: , 3#: , 4#: , 5#: , 6#: , 7#: , 8#: , 9#: , 10#: , 11#: .

Table 4: The congener formal context of .

4.3. Algorithm Analysis

The time complexity of creating concept lattices is the major factor in analyzing the complexity of the algorithm, and computing the formal concepts plays the key role in the whole process of constructing concept lattices. Suppose that the lattice-valued formal context is , where , , , , and are the positive integers. If we compute the formal concepts under Bordat algorithm, the calculation times of the formal concepts are . When increasing attributes, the calculation times of the formal concepts are changed into .

If we utilize the extended algorithm, the increased attributes can be directly obtained by the preliminary attributes, so the calculation times of the formal concepts are . Compared with Bordat algorithm, the calculation times of the formal concepts is . And under the action of the extended algorithm, we can also firstly decompose the lattice-valued formal context into several subformal contexts; that is, , where , are also the positive integers, and the combination algorithm is executed on them; then the calculation times of the formal concepts is . Because of , we can get , ; then ; that is to say, the complexity of this algorithm is significantly decreased.

Suppose that is the lattice-valued formal context based on 6-ary lattice implication algebra, where , . When increasing 10, 20, 30, 40, and 50 attributes into , we can obtain attributes set , , , , and . And furthermore, with the help of the extended algorithm, if we decompose into 5 subcontexts, the calculation times will be greatly reduced. The following experiments, respectively, compare to Bordat algorithm, as Figure 4.

Figure 4: Algorithms comparison of Bordat, extended, and union algorithm.

In Figure 4, the curve (Bordat algorithm), (extended algorithm), and (union algorithm), respectively, presents the calculation times of the formal concepts. By the description of the curves in the experiments, we can draw the conclusion that Bordat algorithm cause the calculation times absolutely increased and its growth rate is far more than that of extended algorithm and union algorithm, and with the help of extended algorithm, we also can see that the calculation times are significantly decreased.

5. Conclusions

As the theoretical premise of the union operation of lattice-valued concept lattice, our research about attribute extended algorithm of lattice-valued concept lattice is helpful to provide useful conditions not only to distribute various databases but also to make an important progress toward practical application of concept lattice. From the definitions of attribute extended formal context and congener formal context, this paper researches the necessary and sufficient conditions of forming attribute values under the condition that the extent set keeps invariable when the new attribute is increased. The algorithms of generating lattice-valued formal context and building concept lattice based on these conditions are proposed.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work is partially supported by the National Natural Science Foundation of People’s Republic of China (Grant no. 60875034) and the Research Fund for the Doctoral Program of Higher Education (Grant no. 20060613007).

References

G. Birkhoff, Lattice Theory: American Mathematical Society Colloquium Publications Volume XXV, American Mathematical Society, Providence, RI, USA, 1967.

R. Wille, “Restructuring lattice theory: an approach based on hierarchies of concepts. I,” in Ordered Sets (Banff, Alta., 1981), I. Rival, Ed., vol. 83 of NATO Advanced Study Institute Series C: Mathematical and Physical Sciences, pp. 445–470, Reidel, Dordrecht, The Netherlands, 1982.

B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations, Springer, Berlin, Germany, 1999.

R. Bělohlávek, V. Sklenář, and J. Zacpal, “Crisply generated fuzzy concepts,” in Proceedings of the 3rd International Conference on Formal Concept Analysis (ICFCA '05), Lecture Notes in Artificial Intelligence, pp. 269–284, February 2005.

W. X. Zhang, Y. Y. Yao, and Y. Liang, Rough Set and Concept Lattice, Xi’an Jiaotong University Press, Xi’an, China, 2006.

M. Shao, M. Liu, and W. Zhang, “Set approximations in fuzzy formal concept analysis,” Fuzzy Sets and Systems, vol. 158, no. 23, pp. 2627–2640, 2007.

M. H. Hu, L. Zhang, and F. L. Ren, “Fuzzy formal concept analysis and fuzzy concept lattices,” Journal of Northeastern University (Natural Science), vol. 28, no. 9, pp. 1274–1277, 2007.

J. Z. Pang, X. Y. Zhang, and W. H. Xu, “Attribute reduction in intuitionistic fuzzy concept lattices,” Abstract and Applied Analysis, vol. 2013, Article ID 271398, 12 pages, 2013.

P. Butka, J. Pocs, and J. Pocsova, “Representation of fuzzy concept lattices in the framework of classical FCA,” Journal of Applied Mathematics, vol. 2013, Article ID 236725, 7 pages, 2013.

L. Yang and Y. Xu, “Decision making with uncertainty information based on lattice-valued fuzzy concept lattice,” Journal of Universal Computer Science, vol. 16, no. 1, pp. 159–177, 2010.

L. Yang and Y. Xu, “A decision method based on uncertainty reasoning of linguistic truth-valued concept lattice,” International Journal of General Systems, vol. 39, no. 3, pp. 235–253, 2010.

L. Yang, Y. H. Wang, and Y. Xu, “A combination algorithm of multiple lattice-valued concept lattices,” International Journal of Computational Intelligence Systems, vol. 6, no. 5, pp. 881–892, 2013.

Y. Xu, “Lattice implication algebras,” Journal of Southwest Jiaotong University, vol. 289, pp. 20–27, 1993 (Chinese).

Y. Xu, D. Ruan, K. Qin, and J. Liu, Lattice-Valued Logic-An Alternative Approach to Treat Fuzziness and Incomparability, vol. 132, Springer, Berlin, Germany, 2003.

Y. Xu, S. Chen, and J. Ma, “Linguistic truth-valued lattice implication algebra and its properties,” in Proceedings of the IMACS Multiconference on Computational Engineering in Systems Applications (CESA '06), pp. 1413–1418, Beijing, China, October 2006.

Y. Li and Z. T. Liu, “Theoretical research on the distributed construction of concept lattices,” in Proceedings of the 2nd International Conference on Machine Learning and Cybernetics, pp. 474–479, Xian, China, 2003.

R. Xie, Z. Pei, and C. L. He, “Reconstructing algorithm of concept lattice in adding attribute process,” Journal of Systems Engineering, vol. 22, no. 4, pp. 426–431, 2007.

Y. Li, Z. T. Liu, L. C. Chen, X. H. Xu, and W. C. Cheng, “Horizontal union algorithm of multiple concept lattices,” Acta Electronica Sinica, vol. 32, no. 11, pp. 1849–1854, 2004.

L. Zhang, X. J. Shen, D. J. Han, et al., “Vertical union algorithm of concept lattices based on synonymous concept,” Computer Engineering and Applications, vol. 43, no. 2, pp. 95–98, 2007.

M. Liu, M. Shao, W. Zhang, and C. Wu, “Reduction method for concept lattices based on rough set theory and its application,” Computers & Mathematics with Applications, vol. 53, no. 9, pp. 1390–1410, 2007.

X. Wang and W. X. Zhang, “Relations of attribute reduction between object and property oriented concept lattices,” Knowledge-Based Systems, vol. 21, no. 5, pp. 398–403, 2008.

S. Y. Zhao and E. C. C. Tsang, “On fuzzy approximation operators in attribute reduction with fuzzy rough sets,” Information Sciences, vol. 178, no. 16, pp. 3163–3176, 2008.