Abstract
In relational theory, attribute domains are classical sets; no interactions among attribute values are modeled. So the concept hierarchies, which are additional semantics, used in data mining have to be input by users. In this paper, “real world” data model - relational model with additional semantics specified by binary relational structures (adopt from first order logic) - are explored; in such model, concept hierarchies/networks can be generated automatically. In fact, there are two families of concepts. One family forms a traditional hierarchy. Another forms a hierarchy syntactically, but semantically the hierarchy is a network; this is due to the fact that distinct concepts may be semantically related. A simple example is illustrated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Y.D. Cai, N. Cercone, and J. Han. “Attribute-oriented induction in relational databases,” in Knowledge Discovery in Databases, pages 213–228. AAAI/MIT Press, Cambridge, MA, 1991.
Date, C., An Introduction to Database Systems-Vol I, 7th ed., Addison-Wesley, 2000.
Maier, D.: The Theory of Relational Databases. Computer Science Press, 1983 (6th printing 1988).
T.Y. Lin, “Data Mining and Machine Oriented Modeling: A Granular Computing Approach,” Journal of Applied Intelligence, Vol 13,N. 2, September/October, Kluwer,2000, pp.113–124.
Eric Louie and T.Y. Lin, “Finding Association Rules using Fast Bit Computation: Machine-Oriented Modeling.” In: Proceeding of 12th International Symposium IS-MIS2000, Charlotte, North Carolina, Oct 11-14, 2000. Lecture Notes in AI 1932. 486–494.
T.Y. Lin, “Granular Computing on Binary Relations I: Data Mining and Neighborhood Systems.” In: Rough Sets In Knowledge Discovery, A. Skoworn and L. Polkowski (eds), Springer-Verlag, 1998, 107–121
An Overview of Rough Set Theory from the Point of View of Relational Databases, Bulletin of International Rough Set Society, Vol I,No1, March, 1997, 30–34.
M. Hadjimichael and T.Y. Lin, “Non-classificatory Generalization in Data Mining.” In: the Proceedings of The Fourth Workshop on Rough Sets, Fuzzy Sets and Machine Discovery, Tokyo, Japan, November 8-10,1996, 404–411.
T.Y. Lin, “Topological and Fuzzy Rough Sets.” In: Decision Support by Experience-Application of the Rough Sets Theory, R. Slowinski (ed.), Kluwer Academic Publishers, 1992, 287–304.
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic, Dordrecht (1991)
W. Ziarko, “Variable Precision Rough Set Model.” Journal of Computer and Systems Science Vol 46,No1, February, Academic Press, 1993, pp.38–59.
Y.Y. Yao, “Information tables with neighborhood semantics.” In: Proceeding of 14th Annual International Symposium Aerospace/Defense Sensing, Simulation, and Controls, SPIE Vol 4057, pp. 108–116, Orlando, April 24-28, 2000
W. Sierpenski and C. Krieger, General Topology, University of Torranto Press 1952.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, T.Y. (2001). Generating Concept Hierarchies/Networks: Mining Additional Semantics in Relational Data. In: Cheung, D., Williams, G.J., Li, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2001. Lecture Notes in Computer Science(), vol 2035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45357-1_22
Download citation
DOI: https://doi.org/10.1007/3-540-45357-1_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41910-5
Online ISBN: 978-3-540-45357-4
eBook Packages: Springer Book Archive