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.

Özden Gür-Ali

dblp:18/1968 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1997
—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 · 3 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 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
2 papers
Data mining · 64% Data integration and cleaning · 28% Distributed and cloud data management · 8%
Artificial intelligence
2 papers
Trustworthy machine learning · 60% Probabilistic and Bayesian machine learning · 40%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › big data analytics › large-scale data mining
distributed data mining
0.011997
Integrating and Mining Distributed Customer Databases · KDD 1997
Machine learning › Trustworthy machine learning
interpretability
0.011993
Induction of Rules Subject to a Quality Constraint: Probabilistic Inductive Learning · IEEE Trans. Knowl. Data Eng. 1993
Machine learning › Trustworthy machine learning › interpretability › logic-based explanation › rule-based explanation
rule extraction
0.011993
Induction of Rules Subject to a Quality Constraint: Probabilistic Inductive Learning · IEEE Trans. Knowl. Data Eng. 1993
Data mining › predictive modeling
classification
0.011993
Induction of Rules Subject to a Quality Constraint: Probabilistic Inductive Learning · IEEE Trans. Knowl. Data Eng. 1993
Data mining › predictive modeling › classification
rule induction
0.011993
Induction of Rules Subject to a Quality Constraint: Probabilistic Inductive Learning · IEEE Trans. Knowl. Data Eng. 1993
Programming languages and type systems
type systems
0.011995
An Assessment of PrIL · KDD 1995
Data mining › predictive modeling › classification
decision tree learning
0.011993
Induction of Rules Subject to a Quality Constraint: Probabilistic Inductive Learning · IEEE Trans. Knowl. Data Eng. 1993

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

probabilistic inductive learning · 0.0decision tree · 0.0
YearPublicationVenuePosition
1997 Integrating and Mining Distributed Customer Databases
Ira J. Haimowitz, Özden Gür-Ali, Henry Schwarz
KDD2
1997 Bridging the gap between business objectives and parameters of data mining algorithms
Özden Gür-Ali, William A. Wallace
Decis. Support Syst.1
1995 An Assessment of PrIL
Özden Gür-Ali, William A. Wallace
KDD1
1995 Classifying delinquent customers for credit collections: an application of probabilistic inductive learning
Özden Gür-Ali, William A. Wallace
Int. J. Hum. Comput. Stud.1
1993 Induction of Rules Subject to a Quality Constraint: Probabilistic Inductive Learning
abstract
Organizational databases are being used to develop rules or guidelines for action that are incorporated into decision processes. Tree induction algorithms of two types, total branching and subset elimination, used in the generation of rules, are reviewed with respect to their treatment of the issue of quality. Based on this assessment, a hybrid approach, probabilistic inductive learning (PrIL), is presented. It provides a probabilistic measure of goodness for an individual rule, enabling the user to set maximum misclassification levels, or minimum reliability levels, with predetermined confidence that each and every rule will satisfy this criterion. The user is able to quantify the reliability of the decision process, i.e., the invoking of the rules, which is of crucial importance in automated decision processes. PrIL and its associated algorithm are described. An illustrative example based on the claims process at a workers' compensation board is presented.>
Özden Gür-Ali, William A. Wallace
IEEE Trans. Knowl. Data Eng.1