Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead
C Rudin - Nature machine intelligence, 2019 - nature.com
Black box machine learning models are currently being used for high-stakes decision
making throughout society, causing problems in healthcare, criminal justice and other …
making throughout society, causing problems in healthcare, criminal justice and other …
Constraint enforcement on decision trees: A survey
Decision trees have the particularity of being machine learning models that are visually easy
to interpret and understand. Therefore, they are primarily suited for sensitive domains like …
to interpret and understand. Therefore, they are primarily suited for sensitive domains like …
Optimal classification trees
State-of-the-art decision tree methods apply heuristics recursively to create each split in
isolation, which may not capture well the underlying characteristics of the dataset. The …
isolation, which may not capture well the underlying characteristics of the dataset. The …
[KÖNYV][B] Pattern recognition and neural networks
BD Ripley - 2007 - books.google.com
Pattern recognition has long been studied in relation to many different (and mainly
unrelated) applications, such as remote sensing, computer vision, space research, and …
unrelated) applications, such as remote sensing, computer vision, space research, and …
Improved use of continuous attributes in C4. 5
JR Quinlan - Journal of artificial intelligence research, 1996 - jair.org
A reported weakness of C4. 5 in domains with continuous attributes is addressed by
modifying the formation and evaluation of tests on continuous attributes. An MDL-inspired …
modifying the formation and evaluation of tests on continuous attributes. An MDL-inspired …
A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared
on thirty-two datasets in terms of classification accuracy, training time, and (in the case of …
on thirty-two datasets in terms of classification accuracy, training time, and (in the case of …
Scalable Bayesian rule lists
We present an algorithm for building probabilistic rule lists that is two orders of magnitude
faster than previous work. Rule list algorithms are competitors for decision tree algorithms …
faster than previous work. Rule list algorithms are competitors for decision tree algorithms …
Classifier technology and the illusion of progress
DJ Hand - 2006 - projecteuclid.org
A great many tools have been developed for supervised classification, ranging from early
methods such as linear discriminant analysis through to modern developments such as …
methods such as linear discriminant analysis through to modern developments such as …
[PDF][PDF] Simplifying decision trees: A survey
LA Breslow, DW Aha - Knowledge engineering review, 1997 - Citeseer
Induced decision trees are an extensively-researched solution to classi cation tasks. For
many practical tasks, the trees produced by tree-generation algorithms are not …
many practical tasks, the trees produced by tree-generation algorithms are not …
[PDF][PDF] A fast decision tree learning algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to
very large data sets. Although numerous diverse techniques have been proposed, a fast tree …
very large data sets. Although numerous diverse techniques have been proposed, a fast tree …