Abstract
KeyGraph is one of the powerful methods to support mining some knowledge from huge dataset because of its visualization mechanism. It presents the dataset in network diagram with representative events and their relationships. The data analyst reads its relationships, and supposes scenarios from them. This is conceptually very simple process, but it becomes more difficult when the diagram becomes complex. In this paper, to overcome this difficulty, we develop the pre-process to generate simple network KeyGraph and the scenario supposing process which repeats our pre-process, generation of KeyGraph and supposing scenarios.
Similar content being viewed by others
References
Fayyad U, Piatetcky-Shapiro G, Smyth P, Uthurusamy R (1995) Advances in knowledge discovery and data mining. AAAI Press
Han J, Kamber M (2001) Data mining: concepts and techniques. Morgan Kaufmann
Hu X, Hreduction DB (2003) A data preprocessing algorithm for data mining applications. Appl Math Lett 16(6):889–895
Li X (2002) Data reduction via adaptive sampling. Commun Inf Sys 2(1):53–68
Liu H, Motoda H, Yu L (2004) A selective sampling approach to active feature selection. http://www.public.asu.edu/~huanliu/papers/ aij04.pdf
Ohsawa Y (2003) KeyGraph: visualized structure among event clusters. Chance discovery. Springer, Berlin Heidelberg New York, pp 262–275
Ohsawa Y, Benson NE, Yachida M (1998) KeyGraph: automatic indexing by co-occurrence graph based on building construction metaphor. In: Proceedings of advanced digital library conference (IEEE ADL’98), pp 12–18
Okazaki N, Ohsawa Y (2003) Polaris: an integrated data miner for chance discovery. In: Proceedings of the third international workshop on chance discovery and its management. Crete, Greece
Olivetti E, Avesani P (2004) Active sampling for data mining. http://www.eu-lat.org/eenviron/Avesani.pdf
Provost F, Jensen D, Oates T (1999) Efficient progressive sampling. Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining. pp 23–32
Soibelman L, Asce M, Kim H (2002) Data preparation process for construction knowledge generation through knowledge discovery in databases. J Comput Civil Eng January:39–48
Torkkola K (2002) Discriminative features for document classification. In: Proceedings of the international conference on pattern recognition, Quebec City
Veeramachaneni S, Avesani P (2003) Active sampling for feature selection. http://sra.itc.it/people/avesani/doc/icdm03tr. pdf
Weiss G, Provost F (2001) The effect of class distribution on classifier learning. Technical Report ML-TR-43, Department of Computer Science, Rutgers University
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sakakibara, T., Ohsawa, Y. Gradual-increase extraction of target baskets as preprocess for visualizing simplified scenario maps by KeyGraph. Soft Comput 11, 783–790 (2007). https://doi.org/10.1007/s00500-006-0120-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-006-0120-4