Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David Urpani

dblp:50/2668 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
classification
0.011999
Induction By Attribute Elimination · IEEE Trans. Knowl. Data Eng. 1999
Data mining › predictive modeling › classification
decision tree learning
0.011999
Induction By Attribute Elimination · IEEE Trans. Knowl. Data Eng. 1999
Data mining › predictive modeling › classification
rule induction
0.011999
Induction By Attribute Elimination · IEEE Trans. Knowl. Data Eng. 1999
Knowledge, reasoning and agents › Knowledge representation and reasoning
rule learning
0.011996
RITIO - Rule Induction Two In One · KDD 1996

Methods — techniques the papers use, named apart from their topics

entropy measure · 0.0attribute elimination · 0.0rule induction · 0.0
YearPublicationVenuePosition
1999 Induction By Attribute Elimination
abstract
In most data mining applications where induction is used as the primary tool for knowledge extraction from real world databases, it is difficult to precisely identify a complete set of relevant attributes. The paper introduces a novel rule induction algorithm called Rule Induction Two In One (RITIO), which eliminates attributes in the order of decreasing irrelevancy. Like ID3-like decision tree construction algorithms, RITIO makes use of the entropy measure as a means of constraining the hypothesis search space; but, unlike IDS-like algorithms, the hypotheses language is the rule structure and RITIO generates rules without constructing decision trees. The final concept description produced by RITIO is shown to be largely based on only the most relevant attributes. Experimental results confirm that, even on noisy, industrial databases, RITIO achieves high levels of predictive accuracy.
Xindong Wu 0001, David Urpani
IEEE Trans. Knowl. Data Eng.2
1996 Rule Induction Without Decision Tree Construction
Xindong Wu 0001, David Urpani, James A. Sykes
ECAI2
1996 RITIO - Rule Induction Two In One
David Urpani, Xindong Wu 0001, Jim Sykes
KDD1
1995 Facilitating Knowledge Acquisition from Industrial Process Data by Automating Feature Selection
David Urpani, James A. Sykes
IEA/AIE1