Cited By
View all- Ltifi HBenmohamed EKolski CBen Ayed M(2016)Enhanced visual data mining process for dynamic decision-makingKnowledge-Based Systems10.1016/j.knosys.2016.09.009112:C(166-181)Online publication date: 15-Nov-2016
Experiences in building a tool for navigating association rule result sets
Abstract
Practical knowledge discovery is an iterative process. First, the experiences gained from one mining run are used to inform the parameter setting and the dataset and attribute selection for subsequent runs. Second, additional data, either incremental additions to existing datasets or the inclusion of additional attributes means that the mining process is reinvoked, perhaps numerous times. Reducing the number of iterations, improving the accuracy of parameter setting and making the results of the mining run more clearly understandable can thus significantly speed up the discovery process.In this paper we discuss our experiences in this area and present a system that helps the user to navigate through association rule result sets in a way that makes it easier to find useful results from a large result set. We present several techniques that experience has shown us to be useful. The prototype system -- IRSetNav -- is discussed, which has capabilities in redundant rule reduction, subjective interestingness evaluation, item and itemset pruning, related information searching, text-based itemset and rule visualisation, hierarchy based searching and tracking changes between data sets using a knowledge base. Techniques also discussed in the paper, but not yet accommodated into IRSetNav, include input schema selection, longitudinal ruleset analysis and graphical visualisation techniques.
References
[1]
Agrawal, R. & Srikant, R. (1994), Fast algorithms for mining association rules, in 'Twentieth International Conference on Very Large Data Bases', Santiago, Chile, pp. 487--499.]]
[2]
Brin, S., Motwani, R. & Silverstein, C. (1997), Beyond market baskets: generalizing association rules to correlations, pp. 265--276.]]
[3]
Ceglar, A., Roddick, J. F. & Calder, P. (2003), Guiding knowledge discovery through interactive data mining, in P. C. Pendharkar, ed., 'Managing Data Mining Technologies in Organisations: Techniques and Applications', Idea Group Pub., Hershey, PA, pp. 45--87. Ch. 4.]]
[4]
Chapman, P., Kerber, R., Clinton, J., Khabaza, T., Reinartz, T. & Wirth, R. (1999), The crisp-dm process model, Discussion paper, CRISP-DM Consortium.]]
[5]
Cristofor, L. & Simovici, D. A. (2002), Generating an informative cover for association rules., in 'Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan', pp. 597--600.]]
[6]
Freitas, A. (1999), 'On rule interestingness measures', Knowledge Based Systems12(5--6), 309--315.]]
[7]
Fule, P. & Roddick, J. F. (2003), Detecting privacy and ethical sensitivity in data mining results, in V. Estivill-Castro, ed., '27th Australasian Computer Science Conference (ACSC2004)', Vol. 27 of CRPIT, ACS, Dunedin, New Zealand.]]
[8]
Hilderman, R. J. & Hamilton, H. J. (1999), Heuristic measures of interestingness, in J. Zytkow & J. Rauch, eds, '3rd European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'99)', Vol. 1704 of Lecture Notes in Artificial Intelligence, Springer, Prague, pp. 232--241.]]
[9]
Liu, B. & Hsu, W. (1996), Post-analysis of learned rules, in 'AAAI/IAAI, Vol. 1', pp. 828--834.]]
[10]
Liu, B., Hsu, W. & Chen, S. (1997), Using general impressions to analyze discovered classification rules, in 'Knowledge Discovery and Data Mining', pp. 31--36.]]
[11]
Liu, B., Hsu, W., Chen, S. & Ma, Y. (2000), 'Analyzing the subjective interestingness of association rules', IEEE Intelligent Systems15(5), 47--55.]]
[12]
Liu, B., Hsu, W. & Ma, Y. (1999), Pruning and summarizing the discovered associations, in 'Knowledge Discovery and Data Mining', pp. 125--134.]]
[13]
Liu, B., Hsu, W. & Ma, Y. (2001), Discovering the set of fundamental rule changes, in 'Seventh ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD-2001)', ACM, San Francisco, CA.]]
[14]
Matheus, C. J., Piatetsky-Shapiro, G. & McNeill, D. (1995), Key findings reporter for analysis of health-care information, in U. M. Fayyad & R. Uthurusamy, eds, 'First International Conference on Knowledge Discovery and Data Mining (KDD-95)', AAAI Press, Menlo Park, CA, USA, Montreal, Canada, p. Demonstration.]]
[15]
Meo, R. (2000), 'Theory of dependence values', ACM Transactions on Database Systems25(3), 380--406.]]
[16]
Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. (1999), Discovering frequent closed itemsets for association rules, in 'Proceedings of the 7th International Conference on Database Theory (ICDT99)', Springer, Jerusalem, Israel, pp. 398--416.]]
[17]
Pei, J., Han, J. & Mao, R. (2000), Closet: An efficient algorithm for mining frequent closed itemsets, in 'ACM SIGMOD International Workshop on Data Mining', ACM Press, Dallas, Texas, pp. 21--30.]]
[18]
Piatetsky-Shapiro, G. & Matheus, C. (1994), The interestingness of deviations, in U. M. Fayyad & R. Uthurusamy, eds, 'AAAI-94 Workshop on Knowledge Discovery in Databases', IEEE Press, Seattle, Washington, USA, pp. 25--36.]]
[19]
Roddick, J. F., Fule, P. & Graco, W. J. (2003), 'Exploratory medical knowledge discovery: Experiences and issues', SigKDD Explorations5(1), 94--99.]]
[20]
Sahar, S. (1999), Interestingness via what is not interesting, in S. Chaudhuri & D. Madigan, eds, 'Fifth International Conference on Knowledge Discovery and Data Mining', ACM Press, San Diego, CA, USA, pp. 332--336.]]
[21]
Silberschatz, A. & Tuzhilin, A. (1996), 'What makes patterns interesting in knowledge discovery systems?', IEEE Transactions on Knowledge and Data Engineering8(6), 970--974.]]
[22]
Toivonen, H., Klemettinen, M., Ronkainen, P., Hatonen, K. & Mannila, H. (1995), Pruning and grouping of discovered association rules, in 'ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases', Heraklion, Greece, pp. 47--52.]]
[23]
Tuzhilin, A. & Gediminas, A. (2002), Handling very large numbers of association rules in the analysis of microarray data, in 'Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining', ACM, Edmonton, Alberta, Canada, pp. 396--404.]]
[24]
Zaki, M. J. & Hsiao, C.-J. (2002), Charm: An efficient algorithm for closed itemset mining, in 'Second SIAM International Conference on Data Mining', SIAM, Arlington, Vancouver, pp. 457--473.]]
Index Terms
- Experiences in building a tool for navigating association rule result sets
Recommendations
Mining N-most interesting itemsets without support threshold by the COFI-tree
Data mining is the discovery of interesting and hidden patterns from a large amount of collected data. Applications can be found in many organisations with large databases, for many different purposes such as customer relationships, marketing, planning, ...
An efficient graph-based approach to mining association rules for large databases
The task of data mining is to find the useful information within the incredible sets of data. One of important research areas of data mining is mining association rules. If we can find these relations by mining association rules, we can provide better ...
Association-rule knowledge discovery by using a fuzzy mining approach
Due to increasing use of very large database and data warehouses, discovering useful knowledge from transactions is becoming an important research area. One of approaches is fuzzy classification. Hong and Lee (1996) proposed a learning method that ...
Comments
Information & Contributors
Information
Published In
Publisher
Australian Computer Society, Inc.
Australia
Publication History
Published: 01 January 2004
Author Tags
Qualifiers
- Article
Conference
ACSW Frontiers '04
Acceptance Rates
Overall Acceptance Rate 204 of 424 submissions, 48%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 418Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)16
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
Cited By
View all- Ltifi HBenmohamed EKolski CBen Ayed M(2016)Enhanced visual data mining process for dynamic decision-makingKnowledge-Based Systems10.1016/j.knosys.2016.09.009112:C(166-181)Online publication date: 15-Nov-2016
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in