Knowledge discovery: comprehensibility of the results

Knowledge discovery in databases (KDD) and machine learning researchers recognize that comprehensibility is an important condition for the use, and therefore usefulness, of knowledge discovery methods. An investigation of the comprehensibility of the discovered patterns may benefit IS research as well. This paper identifies some of the issues that such inquiry may face. Related findings and conclusions of four case studies focusing on applications of decision tree induction methods, are described. A discussion based on these studies suggests, among the rest, that the problem of comprehensibility is complicated by a complex context due to a diversity of problem domain attributes, user and task characteristics, algorithmic methods, and concurrency of user goals. Solutions to problems of discovered patterns that are not easy to interpret and validate may involve integration of available information technologies, and utilization of multiple information types and sources. An investigation of comprehensibility issues may benefit from the adoption of multiple definitions in relation to this concept