Robert Hilderman, Howard Hamilton  Home/Search
Context Related
| cs.uregina.ca/research/Techre...9904.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uregina.ca/research/Te...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Knowledge discovery in databases, also known as data mining, is the efficient discovery of previously unknown, valid, novel, potentially useful, and understandable patterns in large databases. It encompasses many different techniques and algorithms which differ in the kinds of data that can be analyzed and the form of knowledge representation used to convey the discovered knowledge. An important problem in the area of data mining is the development of effective measures of interestingness... (Update)
Cited by: More
Event Sequence Mining to Develop Profiles for Computer.. - Investigation Purposes.. (Correct)
Interestingness of Frequent Itemsets Using Bayesian.. - Jaroszewicz, Simovici (2004) (Correct)
A Comparison of Hardware and Software in Sequence Rule Evolution - Hetland, Saetrom (2003) (Correct)
Active bibliography (related documents): More All
0.6: Ranking the Interestingness of Summaries from Data Mining .. - Hilderman, Hamilton.. (1999) (Correct)
0.6: An Analysis of Quantitative Measures Associated with Rules - Yao, Zhong (1999) (Correct)
0.6: Reducing Redundancy in Characteristic Rule Discovery by.. - Brijs, Vanhoof, Wets (2000) (Correct)
Similar documents based on text: More All
1.0: Heuristics for Ranking the Interestingness of Discovered.. - Hilderman, Hamilton (1999) (Correct)
0.9: Applying Objective Interestingness Measures in Data Mining.. - Hilderman, Hamilton (2000) (Correct)
0.8: Heuristic Measures of Interestingness - Hilderman, Hamilton (1999) (Correct)
Related documents from co-citation: More All
6: Mining the Most Interesting Rules (context) - Bayardo, Agrawal - 1999
5: A belief-driven method for discovering unexpected patterns - Padmanabhan, Tuzhilin - 1998
5: Interestingness and Pruning of Mined Patterns - Shah, Lakshmanan et al. - 1999
BibTeX entry: (Update)
R.J. Hilderman and H.J. Hamilton. Knowledge discovery and interestingness measures: A survey. Technical Report CS 99-04, Department of Computer Science, University of Regina, October 1999. http://citeseer.ist.psu.edu/hilderman99knowledge.html More
@misc{ hilderman99knowledge,
author = "R. Hilderman and H. Hamilton",
title = "Knowledge discovery and interestingness measures: A survey",
text = "R.J. Hilderman and H.J. Hamilton. Knowledge discovery and interestingness
measures: A survey. Technical Report CS 99-04, Department of Computer Science,
University of Regina, October 1999.",
year = "1999",
url = "citeseer.ist.psu.edu/hilderman99knowledge.html" }
Citations (may not include all citations):2177 Programs for Machine Learning (context) - Quinlan - 1993
1359 Induction of decision trees (context) - Quinlan - 1986
921 Mining association rules between sets of items in large data.. - Agrawal, Imielinski et al. - 1993
910 Fast algorithms for mining association rules - Agrawal, Srikant - 1994
475 Automatic subspace clustering of high dimensional data for d.. - Agrawal, Gehrke et al. - 1998
417 Stochastic complexity in statistical inquiry (context) - Rissanen - 1989
400 Fast discovery of association rules (context) - Agrawal, Mannila et al. - 1996
349 Knowledge acquisition via incremental conceptual clustering (context) - Fisher - 1987
340 Mining sequential patterns - Agrawal, Srikant - 1995
282 Finding groups in data: an introduction to cluster analysis (context) - Kaufman, Rousseeuw - 1978
274 Generalization as search (context) - Mitchell - 1982
242 Efficient and effective clustering methods for spatial data .. - Ng, Han - 1994
242 Dynamic itemset counting and implication rules for market ba.. - Brin, Motwani et al. - 1997
233 The CN2 induction algorithm - Clark, Niblett - 1989
222 Birch: an efficient data clustering method for very large da.. - Zhang, Ramakrishnan et al. - 1996
210 A density-based algorithm for discovering clusters in large .. - Ester, Kriegel et al. - 1996
189 Discovering frequent episodes in sequences (context) - Mannila, Toivonen et al. - 1995
164 An efficient algorithm for mining association rules in large.. (context) - Savasere, Omiecinski et al. - 1995
157 Mining sequential patterns: generalization and performance i.. - Srikant, Agrawal - 1996
156 Beyond market baskets: Generalizing association rules to cor.. - Brin, Motwani et al. - 1997
145 Sprint: a scalable parallel classifier for data mining - Shafer, Agrawal et al. - 1996
139 Knowledge discovery in databases: An overview - Frawley, Piatetsky-Shapiro et al. - 1991
139 Learning from observation: conceptual clustering (context) - Michalski, Stepp - 1983
137 Finding interesting rules from large sets of discovered asso.. - Klemettinen, Mannila et al. - 1994
125 An effective hash-based algorithm for mining association rul.. - Park, Chen et al. - 1995
121 Mining association rules with item constraints - Srikant, Vu et al. - 1997
117 IEEE Transactions on Knowledge and Data Engineering (context) - Agrawal, Shafer et al. - 1996
115 Scalable parallel data mining for association rules - Han, Karypis et al. - 1997
111 Sliq: a fast scalable classifier for data mining - Mehta, Agrawal et al. - 1996
109 New algorithms for fast discovery of association rules - Zaki, Parthasarathy et al. - 1997
87 Similarity-based queries for time series data - Rafiei, Mendelzon - 1997
85 Discovering generalized episodes using minimaloccurrences - Mannila, Toivonen - 1996
78 An enhanced representation of time series which allows fast .. - Keogh, Pazzani - 1998
75 Rule discovery from times series - Das, Lin et al. - 1998
73 The multi-purpose incremental learning system aq15 and its t.. (context) - Michalski, Mozetic et al. - 1986
71 Sting: a statistical information grid approach to spatial da.. - Wang, Yang et al. - 1997
68 Version Spaces: An Approach to Concept Learning (context) - Mitchell - 1978
46 Rule induction using information theory (context) - Smyth, Goodman - 1991
42 On subjective measures of interestingness in knowledge disco.. - Silberschatz, Tuzhilin - 1995
37 Using general impressions to analyze discovered classificati.. - Liu, Hsu et al. - 1997
36 A belief-driven method for discovering unexpected patterns - Padmanabhan, Tuzhilin - 1998
28 Selecting among rules induced from a hurricane database (context) - Major, Mangano - 1993
23 Mining segment-wise periodic patterns in time-related databa.. - Han, Ging et al. - 1998
23 The analysis of cross-classified categorical data (context) - Fienberg - 1978
20 Learning to predict rare events in event sequences - Weiss, Hirsh - 1998
19 Evaluating the interestingness of characteristic rules (context) - Kamber, Shinghal - 1996
17 PlanMine: sequence mining for plan failures - Zaki, Lesh et al. - 1998
16 analysis and presentation of strong rules (context) - Piatetsky-Shapiro - 1991
14 Selecting and reporting what is interesting: The kefir appli.. (context) - Matheus, Piatetsky-Shapiro - 1996
13 Interestingness of discovered association rules in terms of .. - Dong, Li - 1998
11 From data mining to knowledge discovery (context) - Fayyad, Piatetsky-Shapiro et al. - 1996
11 Sampling large databases for finding association rules (context) - Toivonen - 1996
10 On objective measures of rule surprisingness - Freitas - 1998
10 Pattern directed mining of sequence data (context) - Guralnik, Wijesekera et al. - 1998
9 Clouds: a decision tree classifier for large datasets - Alsabti, Ranka et al. - 1998
9 Pattern discovery in temporal databases: a temporal logic ap.. - Padmanabhan, Tuzhilin - 1996
9 Distributed tree construction from large datasets (context) - Fifield - 1992
9 From contingency tables to various forms of knowledge in dat.. (context) - Zembowicz, Zytkow - 1996
6 A metric for selection of the most promising rules (context) - Gago, Bentos - 1998
6 Ccaiia: clustering categorical attributes into interesting a.. (context) - Gray, Orlowska - 1998
6 Peculiarity-oriented multi-database mining (context) - Zhong, Yao et al. - 1999
6 Efficient search of reliable exceptions - Liu, Lu et al. - 1999
5 The analysis of cross-classifications (context) - Reynolds - 1977
4 Mining market basket data using share measures and character.. - Hilderman, Carter et al. - 1998
4 An integration of rule induction and exemplar-based learning.. (context) - Zhang, Michalski - 1995
4 Discovery of association rules over ordinal data: a new and .. (context) - Buchter, Wirth - 1998
3 Estimating DBLearn's potential for knowledge discovery in da.. (context) - Hamilton, Fudger - 1995
2 Machine learning of credible classifications (context) - Hamilton, Shan et al. - 1997
2 Discovering enrollment knowledge in university databases (context) - Sanjeev, Zytkow - 1995
2 Analyzing binary associations (context) - Knobbe, Adrians - 1996
2 The analysis of cross-classified data having ordered categor.. (context) - Goodman - 1984
1 Are we losing accuracy while gaining confidence in induced r.. (context) - Gur-Ali, Wallace - 1995
1 Time series forecasting from high-dimensional data with mult.. (context) - Rao, Rickard et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uregina.ca/research/Techreports/index.html): More
An Algorithm for Solving Constraint-Satisfaction Problems - Pang, Goodwin (Correct)
Constraint-Directed Backtracking Algorithm for.. - Pang, Goodwin (1996) (Correct)
A Rational Function Model of Spatial Summation and Single.. - Wang Zhang (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC