找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Knowledge Discovery in Databases: PKDD 2003; 7th European Confere Nada Lavrač,Dragan Gamberger,Hendrik Blockeel Conference proceedings 2003

[复制链接]
楼主: 警察在苦笑
发表于 2025-3-23 13:14:56 | 显示全部楼层
Mr-SBC: A Multi-relational Naïve Bayes Classifierred in several tables related by foreign key constraints and each example is represented by a set of related tuples rather than a single row as in the classical data mining setting. This work is characterized by three aspects. First, an integrated approach in the computation of the posterior probabi
发表于 2025-3-23 17:09:42 | 显示全部楼层
SMOTEBoost: Improving Prediction of the Minority Class in Boostingnority (or interesting) class usually produces biased classifiers that have a higher predictive accuracy over the majority class(es), but poorer predictive accuracy over the minority class. SMOTE (Synthetic Minority Over-sampling TEchnique) is specifically designed for learning from imbalanced data
发表于 2025-3-23 18:25:38 | 显示全部楼层
Using Belief Networks and Fisher Kernels for Structured Document Classifications to simultaneously take into account structure and content information. We then show how this model can be extended into a more efficient classifier using the Fisher kernel method. In both cases model parameters are learned from a labelled training set of representative documents. We present experi
发表于 2025-3-23 23:18:48 | 显示全部楼层
A Skeleton-Based Approach to Learning Bayesian Networks from Dataes the main advantages of these algorithms yet avoids their difficulties. In our approach, first an undirected graph, termed the ., is constructed from the data, using zero- and first-order dependence tests. Then, a search algorithm is employed that builds upon a quality measure to find the best net
发表于 2025-3-24 04:12:45 | 显示全部楼层
发表于 2025-3-24 09:51:08 | 显示全部楼层
发表于 2025-3-24 11:46:57 | 显示全部楼层
Visualizing Class Probability Estimatorsto the users is how to gain information from the models produced. Unfortunately, some of the most powerful inductive learning algorithms generate “black boxes”—that is, the representation of the model makes it virtually impossible to gain any insight into what has been learned. This paper presents a
发表于 2025-3-24 16:50:19 | 显示全部楼层
发表于 2025-3-24 20:13:24 | 显示全部楼层
发表于 2025-3-25 00:10:19 | 显示全部楼层
Conference proceedings 2003tted papers, 40 were accepted for publication in the ECML2003proceedings,and40wereacceptedforpublicationinthePKDD2003 proceedings. All the submitted papers were reviewed by three referees. In ad- tion to submitted papers, the conference program consisted of four invited talks, four tutorials, seven
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-16 01:55
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表