(Enter summary)
Abstract: Distance is used as a measurement in most of instance-based classification systems. Rather than
using distance, we make use of the frequency of an instance's subsets and the frequency-changing rate
of the subsets among training classes to perform both knowledge discovery and classification tasks. We
name the system DeEPs. Whenever an instance is considered, DeEPs can efficiently discover those
patterns contained in the instance which sharply differentiate the training classes from one to... (Update)
Similar documents based on text: More All
1.3: Emerging Patterns and Gene Expression Data - Li, Wong
(Correct)
1.0: Identifying Good Diagnostic Gene Groups from Gene Expression.. - Li, Wong (2002)
(Correct)
1.0: Named Entity Recognition using an HMM-based Chunk Tagger - Zhou, Su (2002)
(Correct)
BibTeX entry: (Update)
Li, J., Dong, G., Ramamohanaro, K. and Wong, L. (2001). DeEPs: A new instance-based discovery and classification system. [http://sdmc.krdl.org.sg:8080/limsoon/limsoonpapers.html], School of Computing, National University of Singapore. http://citeseer.ist.psu.edu/li01deeps.html More
@misc{ li01deeps,
author = "J. Li and G. Dong and K. Ramamohanaro and L. Wong",
title = "DeEPs: A new instance-based discovery and classification system",
text = "Li, J., Dong, G., Ramamohanaro, K. and Wong, L. (2001). DeEPs: A new instance-based
discovery and classification system. [http://sdmc.krdl.org.sg:8080/limsoon/limsoonpapers.html],
School of Computing, National University of Singapore.",
year = "2001",
url = "citeseer.ist.psu.edu/li01deeps.html" }
Citations (may not include all citations):
2177
Programs for machine learning (context) - Quinlan - 1993
2133
Pattern classification and scene analysis (context) - Duda, Hart - 1973
1359
Induction of decision trees (context) - Quinlan - 1986
503
Instance-based learning algorithms (context) - Aha, Kibler et al. - 1991
296
A probabilistic theory of pattern recognition (context) - Devroye, Gyorfi et al. - 1996
286
Nearest neighbor pattern classification (context) - Cover, Hart - 1967
274
Generalization as search (context) - Mitchell - 1982
216
Very simple classification rules perform well on most common.. (context) - Holte - 1993
203
Multi-interval discretization of continuous-valued attribute.. (context) - Fayyad, Irani - 1993
138
Bayesian network classifiers
- Friedman, Geiger et al. - 1997
137
Finding interesting rules from large sets of discovered asso..
- Klemettinen, Mannila et al. - 1994
107
A nearest hyperrectangle learning method (context) - Salzberg - 1991
91
Integrating classification and association rule mining
- Liu, Hsu et al. - 1998
80
What makes patterns interesting in knowledge discovery syste..
- Silberschatz, Tuzhilin - 1996
73
Mining the most interesting rules (context) - Bayardo, Agrawal - 1999
[Article contains additional citations not shown here]
Documents on the same site (http://sdmc.krdl.org.sg:8080/~limsoon/limsoonpapers.html): More
Polymorphic Queries Across Sets, Bags, and Lists - Wong (1994)
(Correct)
Lower Bounds for Invariant Queries in Logics with Counting - Libkin, Wong (2002)
(Correct)
Comprehension Syntax - Buneman, Libkin, Suciu, Tannen, Wong (1994)
(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