Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Webb (2003)
Beyond Association Rules: Generalized Rule Discovery
G. Piatetsky-Shapiro (1991)
Discovery, Analysis, and Presentation of Strong Rules
K. Frantzi, S. Ananiadou (1997)
Automatic Term Recognition using Contextual Cues
Chi-Hoon Lee, Kim Hyeon, P. Rhee (2001)
Web personalization expert with combining collaborative filtering and association rule mining techniqueExpert Syst. Appl., 21
(1999)
Evolutionary hot spots data mining
R. French (1990)
Subcognition and the Limits of the TuringTestMind, 99
T. Landauer, S. Dumais (1997)
A Solution to Plato's Problem: The Latent Semantic Analysis Theory of Acquisition, Induction, and Representation of Knowledge.Psychological Review, 104
Sugato Basu, R. Mooney, Krupakar Pasupuleti, Joydeep Ghosh (2001)
Evaluating the novelty of text-mined rules using lexical knowledge
B. Padmanabhan, A. Tuzhilin (1998)
A Belief-Driven Method for Discovering Unexpected Patterns
R. Agrawal, R. Srikant (1994)
Fast Algorithms for Mining Association Rules in Large Databases
G. Grefenstette (1993)
Evaluation Techniques for Automatic Semantic Extraction: Comparing Syntactic and Window Based Approaches
Ronen Feldman, H. Hirsh (1996)
Mining Associations in Text in the Presence of Background Knowledge
W. Croft, Jing Yufeng (1994)
An Association Thesaurus for Information Retrieval
R. Rapp, M. Wettler (1991)
Prediction of free word associations based on Hebbian learning[Proceedings] 1991 IEEE International Joint Conference on Neural Networks
A. Silberschatz, A. Tuzhilin (1996)
What Makes Patterns Interesting in Knowledge Discovery SystemsIEEE Trans. Knowl. Data Eng., 8
G. Miller, R. Beckwith, C. Fellbaum, Derek Gross, K. Miller (1990)
Introduction to WordNet: An On-line Lexical DatabaseInternational Journal of Lexicography, 3
Guozhu Dong, Jinyan Li (1998)
Interestingness of Discovered Association Rules in Terms of Neighborhood-Based Unexpectedness
R. Rapp (2003)
Syntagmatic and Paradigmatic Associations in Information Retrieval
A. Geyer-Schulz, Michael Hahsler (2002)
Evaluation of Recommender Algorithms for an Internet Information Broker based on Simple Association Rules and on the Repeat-Buying Theory
M. Rajman, Romaric Besançon (1998)
Text Mining, knowledge extraction from unstructured textual data
Soumen Chakrabarti, Sunita Sarawagi, B. Dom (1998)
Mining Surprising Patterns Using Temporal Description Length
G. Piatetsky–Shapiro (1991)
Knowledge Discovery in Databases
B. Mobasher, R. Cooley, J. Srivastava (2000)
Automatic personalization based on Web usage miningCommun. ACM, 43
W. Kintsch (2001)
PredicationCogn. Sci., 25
A. Turing (1950)
Computing Machinery and IntelligenceMind, LIX
F. Lavigne, P. Lavigne (2000)
Anticipatory Semantic ProcessesInternational Journal of Computing
Guoqing Chen, Q. Wei, De Liu, G. Wets (2002)
Simple association rules (SAR) and the SAR-based rule discoveryComputers & Industrial Engineering, 43
P. Tan, Vipin Kumar, J. Srivastava (2002)
Selecting the right interestingness measure for association patternsProceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
R. Agrawal, R. Srikant (1998)
Fast Algorithms for Mining Association Rules
D. Nelson, C. McEvoy, Thomas Schreiber (2004)
The University of South Florida free association, rhyme, and word fragment normsBehavior Research Methods, Instruments, & Computers, 36
R. Tamir (2003)
Internet Thesaurus — Extracting Relevant Terms from WWW Pages using Weighted Threshold Function over a Cross-Reference Matrix
Michael Wilson (1988)
MRC psycholinguistic database: Machine-usable dictionary, version 2.00Behavior Research Methods, Instruments, & Computers, 20
A. Amir, Ronen Feldman, R. Kashi (1997)
A New and Versatile Method for Association Generation
B. Liu, Y. Ma, C. Wong, Philip Yu (2003)
Scoring the Data Using Association RulesApplied Intelligence, 18
B. Padmanabhan, A. Tuzhilin (2000)
Small is beautiful: discovering the minimal set of unexpected patterns
A. Freitas (1999)
On rule interestingness measuresKnowl. Based Syst., 12
This article presents a new interestingness measure for association rules called confidence gain (CG). Focus is given to extraction of human associations rather than associations between market products. There are two main differences between the two (human and market associations). The first difference is the strong asymmetry of human associations (e.g., the association “shampoo” → “hair” is much stronger than “hair” → “shampoo”), where in market products asymmetry is less intuitive and less evident. The second is the background knowledge humans employ when presented with a stimulus (input phrase). CG calculates the local confidence of a given term compared to its average confidence throughout a given database. CG is found to outperform several association measures since it captures both the asymmetric notion of an association (as in the confidence measure) while adding the comparison to an expected confidence (as in the lift measure). The use of average confidence introduces the “background knowledge” notion into the CG measure. Various experiments have shown that CG and local confidence gain (a low-complexity version of CG) successfully generate association rules when compared to human free associations. The experiments include a large-scale “free sssociation Turing test” where human free associations were compared to associations generated by the CG and other association measures. Rules discovered by CG were found to be significantly better than those discovered by other measures. CG can be used for many purposes, such as personalization, sense disambiguation, query expansion, and improving classification performance of small item sets within large databases. Although CG was found to be useful for Internet data retrieval, results can be easily used over any type of database.
The VLDB Journal – Springer Journals
Published: Jan 1, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.