Concept approximations based on rough sets and similarity measures

Jamil Saquer; Jitender Deogun

International Journal of Applied Mathematics and Computer Science (2001)

  • Volume: 11, Issue: 3, page 655-674
  • ISSN: 1641-876X

Abstract

top
The formal concept analysis gives a mathematical definition of a formal concept. However, in many real-life applications, the problem under investigation cannot be described by formal concepts. Such concepts are called the non-definable concepts (Saquer and Deogun, 2000a). The process of finding formal concepts that best describe non-definable concepts is called the concept approximation. In this paper, we present two different approaches to the concept approximation. The first approach is based on rough set theory while the other is based on a similarity measure. We present algorithms for the two approaches.

How to cite

top

Saquer, Jamil, and Deogun, Jitender. "Concept approximations based on rough sets and similarity measures." International Journal of Applied Mathematics and Computer Science 11.3 (2001): 655-674. <http://eudml.org/doc/207525>.

@article{Saquer2001,
abstract = {The formal concept analysis gives a mathematical definition of a formal concept. However, in many real-life applications, the problem under investigation cannot be described by formal concepts. Such concepts are called the non-definable concepts (Saquer and Deogun, 2000a). The process of finding formal concepts that best describe non-definable concepts is called the concept approximation. In this paper, we present two different approaches to the concept approximation. The first approach is based on rough set theory while the other is based on a similarity measure. We present algorithms for the two approaches.},
author = {Saquer, Jamil, Deogun, Jitender},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {concept approximation; similarity measures; rough sets; formal concept analysis},
language = {eng},
number = {3},
pages = {655-674},
title = {Concept approximations based on rough sets and similarity measures},
url = {http://eudml.org/doc/207525},
volume = {11},
year = {2001},
}

TY - JOUR
AU - Saquer, Jamil
AU - Deogun, Jitender
TI - Concept approximations based on rough sets and similarity measures
JO - International Journal of Applied Mathematics and Computer Science
PY - 2001
VL - 11
IS - 3
SP - 655
EP - 674
AB - The formal concept analysis gives a mathematical definition of a formal concept. However, in many real-life applications, the problem under investigation cannot be described by formal concepts. Such concepts are called the non-definable concepts (Saquer and Deogun, 2000a). The process of finding formal concepts that best describe non-definable concepts is called the concept approximation. In this paper, we present two different approaches to the concept approximation. The first approach is based on rough set theory while the other is based on a similarity measure. We present algorithms for the two approaches.
LA - eng
KW - concept approximation; similarity measures; rough sets; formal concept analysis
UR - http://eudml.org/doc/207525
ER -

References

top
  1. Carpineto C. and Romano G. (1996): A lattice conceptual clustering system and its application to browsing retrieval. - Mach. Learn., Vol.24, No.2, pp.95-122. 
  2. Ganter B. (1984): Two basic algorithms in concept analysis. - FB4-Preprint No. 831, TH Darmstadt. Zbl1274.68484
  3. Ganter B. and Wille R. (1999): Formal Concept Analysis: Mathematical Foundations. - Berlin: Springer. Zbl0909.06001
  4. Godin R. and Missaoui R. (1994): An incremental concept formation for learning from databases. - Theoret. Comp. Sci., Vol.133, No.2, pp.387-419. Zbl0938.68806
  5. Ho T.B. (1995): An approach to concept formation based on Formal Concept Analysis. - IEICE Trans. Inform. Syst., Vol.78, No.5, pp.553-559. 
  6. Kangassalo H. (1992): On the concept of concept for conceptualmodeling and concept deduction, In: Information Modeling and Knowledge Bases III (S. Ohsuga, H. Kangassalo and H. Jaakkola, Eds.). - Amsterdam: IOS Press, pp.17-58. 
  7. Kent R. (1994): Rough concept analysis. - Proc. Int. Workshop Rough Sets and Knowledge Discovery, Banff, Canada, pp.245-253. 
  8. Kent R. (1996): Rough concept analysis: A synthesis of roughsets and formal concept analysis. - Fund. Inform., Vol.27, No.2, pp.169-181. Zbl0861.68098
  9. Pawlak Z. (1982): Rough sets. - Int. J. Inf. Comp. Sci., Vol.11, No.5, pp.341-356. Zbl0501.68053
  10. Saquer J. and Deogun J. (1999): Formal rough concept analysis, In: New Directions in Rough Sets, Data Mining, and Granular-Soft Computing (N. Zhong, A. Skowron and S. Ohsuga, Eds.). - Yamaguchi, Japan: Springer, pp.91-99. Zbl0954.68137
  11. Saquer J. and Deogun J. (2000a): Concept approximations for formal concept analysis. - Proc. 8-th Int. Conf. Conceptual Structures (ICCS'2000), Vol.II, Working with Conceptual Structures, Darmstadt, Germany, pp.73-83. Zbl0954.68137
  12. Saquer J. and Deogun J. (2000b): Using closed itemsets for discovering representative association rules, In:Proc. 12-th Int. Symp. Methodologies for Intelligent Systems (ISMIS'2000) (Z. Ras and S. Ohsuga, Eds.). - Charlotte, NC: Springer, pp.495-504. Zbl0983.68517
  13. Wille R. (1992): Concept lattices and conceptual knowledge systems. - Comp. Math. Appl., Vol.23., No.5, pp.493-515. Zbl0766.68129
  14. Wille R. (1982): Restructuring lattice theory: An approach based on hierarchies on concepts, In: Ordered Sets (I. Rival, Ed.). - Dordrecht: Reidel, pp.445-470. 
  15. Wille R. (1989): Knowledge acquisition by methods of formal concept analysis, In: Data Analysis, Learning Symbolic and Numeric Knowledge (E. Diday, Ed.). - New York: Nova Science,pp.365-380. 
  16. Zadeh L. (1965): Fuzzy sets. - Inform. Contr., Vol.8, pp.338-353. Zbl0139.24606

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.