找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Discovery Science; 13th International C Bernhard Pfahringer,Geoff Holmes,Achim Hoffmann Conference proceedings 2010 Springer Berlin Heidelb

[復制鏈接]
查看: 10192|回復: 63
樓主
發(fā)表于 2025-3-21 17:17:54 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Discovery Science
副標題13th International C
編輯Bernhard Pfahringer,Geoff Holmes,Achim Hoffmann
視頻videohttp://file.papertrans.cn/282/281040/281040.mp4
概述Up to date results.Fast conference proceedings.State-of-the-art report
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Discovery Science; 13th International C Bernhard Pfahringer,Geoff Holmes,Achim Hoffmann Conference proceedings 2010 Springer Berlin Heidelb
出版日期Conference proceedings 2010
關(guān)鍵詞cloud computing; clustering; cognition; collaborative science; data mining; human-machine interaction; kno
版次1
doihttps://doi.org/10.1007/978-3-642-16184-1
isbn_softcover978-3-642-16183-4
isbn_ebook978-3-642-16184-1Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Berlin Heidelberg 2010
The information of publication is updating

書目名稱Discovery Science影響因子(影響力)




書目名稱Discovery Science影響因子(影響力)學科排名




書目名稱Discovery Science網(wǎng)絡(luò)公開度




書目名稱Discovery Science網(wǎng)絡(luò)公開度學科排名




書目名稱Discovery Science被引頻次




書目名稱Discovery Science被引頻次學科排名




書目名稱Discovery Science年度引用




書目名稱Discovery Science年度引用學科排名




書目名稱Discovery Science讀者反饋




書目名稱Discovery Science讀者反饋學科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:17:01 | 只看該作者
A Similarity-Based Adaptation of Naive Bayes for Label Ranking: Application to the Metalearning Proe been adapted for this task, including k-Nearest Neighbours (k-NN) and decision trees. Following this line, we propose an adaptation of the naive Bayes classification algorithm for the label ranking problem. Our main idea lies in the use of similarity between the rankings to replace the concept of
板凳
發(fā)表于 2025-3-22 02:39:35 | 只看該作者
Topology Preserving SOM with Transductive Confidence Machine,dimension reduction tool for mapping training samples from a high-dimensional input space onto a neuron grid. However, current SOM-based classifiers can not provide degrees of classification reliability for new unlabeled samples so that they are difficult to be used in risk-sensitive applications wh
地板
發(fā)表于 2025-3-22 06:40:31 | 只看該作者
An Artificial Experimenter for Enzymatic Response Characterisation, comparison to the size of the parameter spaces being investigated. New tools are required to assist scientists in the effective characterisation of such behaviours. By combining artificial intelligence techniques for active experiment selection, with a microfluidic experimentation platform that red
5#
發(fā)表于 2025-3-22 12:12:27 | 只看該作者
Subgroup Discovery for Election Analysis: A Case Study in Descriptive Data Mining, of election results. Our inquiry is based on the 2009 German federal Bundestag election (restricted to the City of Cologne) and additional socio-economic information about Cologne’s polling districts. The task is to describe relations between socio-economic variables and the votes in order to summa
6#
發(fā)表于 2025-3-22 13:37:01 | 只看該作者
7#
發(fā)表于 2025-3-22 17:54:58 | 只看該作者
8#
發(fā)表于 2025-3-22 22:26:17 | 只看該作者
9#
發(fā)表于 2025-3-23 05:24:04 | 只看該作者
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages,rning of one-dimensional, bounded, one-way, cellular automata (OCAs) that recognize formal languages from positive and negative sample strings. The objectives of this work are to develop automatic synthesis of parallel systems and to contribute to the theory of real-time recognition by cellular auto
10#
發(fā)表于 2025-3-23 08:01:54 | 只看該作者
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting,t margin optimization problem where each dimension corresponds to a substring pattern. Then we solve this problem by using LPBoost and an optimal substring discovery algorithm. Since the problem is a linear program, the resulting solution is likely to be sparse, which is useful for feature selection
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-25 00:17
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復 返回頂部 返回列表
花莲市| 黎平县| 军事| 宜州市| 墨脱县| 普安县| 南木林县| 思南县| 资中县| 乃东县| 信阳市| 桑植县| 公安县| 东源县| 上饶县| 广汉市| 江西省| 浮山县| 新巴尔虎左旗| 手游| 永昌县| 铜鼓县| 和静县| 道孚县| 富锦市| 丹巴县| 阿图什市| 荣成市| 福贡县| 明光市| 承德县| 万宁市| 锦州市| 蓝山县| 丰宁| 密云县| 陵水| 邵阳市| 理塘县| 孝昌县| 盐源县|