Finding "persistent rules": Combining association and classification results
- Karthik Rajasethupathy,
- Anthony Scime(corresponding author),
- Kulathur S. Rajasethupathy,
- Cornell University,
- The College at Brockport, State University of New York,
- Texas Tech University
Scholary Output:
Contribution to journal
Article
Peer-reviewAbstract
Different data mining algorithms applied to the same data can result in similar findings, typically in the form of rules. These similarities can be exploited to identify especially powerful rules, in particular those that are common to the different algorithms. This research focuses on the independent application of association and classification mining algorithms to the same data to discover common or similar rules, which are deemed "persistent-rules". The persistent-rule discovery process is demonstrated and tested against two data sets drawn from the American National Election Studies: one data set used to predict voter turnout and the second used to predict vote choice.
Publication Information
Output type
Scholary Output:
Contribution to journal
Article
Peer-reviewOriginal language
English (US)Pages from-to (Number of pages)
Pages 6019-6024 (6 pages)Journal (Volume, Issue Number)
Expert Systems with Applications (Volume 36, Issue 3 PART 2)Publication milestones
- Published - 04/2009
Publication status
Published - 04/2009
ISSN
0957-4174Publication IDs
- Scopus: 58349100458
Publication metrics
Metrics
SciVal
FWCI
0.86
SciVal
Author count
4
SciVal
citations
11
SciVal
Paper percentile
64
Fractional count
1
Fractional count
0.25
Fractional count
3
Fractional count
0.75
Fractional count
1
Fractional count
1
PlumX, opens in new tab
Captures
10
Citation count
17
