@inproceedings{611cea025ee74da3b326952dc398873d,

title = "Visualizing discovered rule sets with visual graphs based on compressed entropy density",

abstract = "This paper presents a post-processing algorithm of rule discovery for augmenting the readability of a discovered rule set. Rule discovery, in spite of its usefulness as a fundamental data-mining technique, outputs a huge number of rules. Since usefulness of a discovered rule is judged by human inspection, augmenting the readability of a discovered rule set is an important issue. We formalize this problem as a transformation of a rule set into a tree structure called a visual graph. A novel information-based criterion which represents compressed entropy of a data set per description length of the graph is employed in order to evaluate the readability quantitatively. Experiments with an agricultural data set in cooperation with domain experts confirmed the effectiveness of our method in terms of readability and validness.",

author = "Einoshin Suzuki and Hiroki Ishihara",

year = "1999",

month = jan,

day = "1",

doi = "10.1007/978-3-540-48061-7_50",

language = "English",

isbn = "3540666451",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "414--423",

editor = "Setsuo Ohsuga and Ning Zhong and Andrzej Skowron",

booktitle = "New Directions in Rough Sets, Data Mining, and Granular-Soft Computing - 7th International Workshop, RSFDGrC 1999, Proceedings",

address = "Germany",

note = "7th International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999 ; Conference date: 09-11-1999 Through 11-11-1999",

}