Summary
Data mining is one of the methods to extract some knowledge from large amount of data and KeyGraph is one of the unique methods for data mining. The result of KeyGraph analysis is shown like network diagrams; the analyst tries to understand the meaning of links and make reasonable scenarios. In this process, the more complex the link structure is, the more difficult to understand its meaning. For this difficulty, we developed a preprocessing method enabling to generate simpler link structure at first and also generate more complex structure gradually. By this method, we could obtain more detailed and various scenarios.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yukio Ohsawa, Nels E. Benson, Masahiko Yachida. (1998) “KeyGraph: Automatic Indexing by Segmenting and Unifing Co-occurrence Graph,” pp.68–74, VI-14. No.427, IPS
Naoaki Okazaki. “Polaris”, http://www.chokkan.org/xoops/modules/mydownloads/viewcat.php?cid=2.
Hirokazu Tomobe, Mitsuru Ishiduka. (2003) “Clustering by Documents Categorization Using a Conceptual Co-relation Dictionary” pp.114–120, VI-10. No.423, IPS.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakakibara, T., Ohsawa, Y. (2005). Knowledge Discovery Method by Gradual Increase of Target Baskets from Sparse Dataset. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_54
Download citation
DOI: https://doi.org/10.1007/3-540-32391-0_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25055-5
Online ISBN: 978-3-540-32391-4
eBook Packages: EngineeringEngineering (R0)