標題: Titlebook: Discovery Science; 19th International C Toon Calders,Michelangelo Ceci,Donato Malerba Conference proceedings 2016 Springer International Pu [打印本頁] 作者: Lensometer 時間: 2025-3-21 19:07
書目名稱Discovery Science影響因子(影響力)
書目名稱Discovery Science影響因子(影響力)學科排名
書目名稱Discovery Science網(wǎng)絡公開度
書目名稱Discovery Science網(wǎng)絡公開度學科排名
書目名稱Discovery Science被引頻次
書目名稱Discovery Science被引頻次學科排名
書目名稱Discovery Science年度引用
書目名稱Discovery Science年度引用學科排名
書目名稱Discovery Science讀者反饋
書目名稱Discovery Science讀者反饋學科排名
作者: 苦惱 時間: 2025-3-21 23:01
Predicting Cargo Train Failures: A Machine Learning Approach for a Lightweight Prototypexisting software, whereas more complex classifiers would require costly software adaptations. In order to predict a time series of instances, we construct a meta classification layer. We then evaluate our model on the data of 180 locomotive tours by leave one out classification. The results show tha作者: Militia 時間: 2025-3-22 01:44 作者: 極小 時間: 2025-3-22 08:13 作者: 規(guī)范要多 時間: 2025-3-22 10:34 作者: LIEN 時間: 2025-3-22 13:26 作者: LIEN 時間: 2025-3-22 18:18 作者: negotiable 時間: 2025-3-22 22:39
https://doi.org/10.1007/978-3-658-01919-8of focusing on attribute subset selection, we explore an alternative promising approach consisting of using all available textual information. The problem of bug-fix time estimation is then mapped to a text categorization problem. We consider a multi-topic Supervised Latent Dirichlet Allocation (.) 作者: COLON 時間: 2025-3-23 02:00 作者: 剛開始 時間: 2025-3-23 09:22
Second-Order-Faktorenanalyse (SFA)r law and the number of edges increase as a function of time. Therefore, we discuss a sequential sampling method with forgetting factor to sample the evolving ego network stream. This method captures the most active and recent nodes from the network while preserving the tie strengths between them an作者: 舔食 時間: 2025-3-23 13:10
Min-Hashing for Probabilistic Frequent Subtree Feature Spaces作者: erythema 時間: 2025-3-23 14:07
STIFE: A Framework for Feature-Based Classification of Sequences of Temporal Intervals作者: 全神貫注于 時間: 2025-3-23 19:52 作者: 向外供接觸 時間: 2025-3-23 22:54
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281042.jpg作者: 乳汁 時間: 2025-3-24 03:18
Discovery Science978-3-319-46307-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Gudgeon 時間: 2025-3-24 06:47 作者: GULF 時間: 2025-3-24 10:42
978-3-319-46306-3Springer International Publishing Switzerland 2016作者: 下垂 時間: 2025-3-24 15:03 作者: 開始從未 時間: 2025-3-24 21:06 作者: GULP 時間: 2025-3-24 23:25
Stand der Wissenschaft und Technik,eveloped for interaction with possibly large redescription sets, produced on large datasets, and it enables better understanding of the underlying data and relations between attribute sets. New insights from redescription sets can be obtained through three different interaction modes based on: (i) s作者: 未完成 時間: 2025-3-25 03:33
Nachdem der Kopf des K?nigs gefallen istlar target. An important question is how to validate the patterns found; how do we distinguish a true finding from a false discovery? A common solution is to apply a statistical significance test that states that a pattern is real iff it is different from a random subset..In this paper we argue and 作者: Ablation 時間: 2025-3-25 07:56 作者: Chromatic 時間: 2025-3-25 15:35
https://doi.org/10.1007/978-3-658-03986-8nice properties come at the price of predictive performance. Moreover, the standard induction of decision trees suffers from myopia: A single split is chosen in each internal node which is selected in a greedy manner; hence, the resulting tree may be sub-optimal. To address these issues, option tree作者: 紀念 時間: 2025-3-25 16:40
https://doi.org/10.1007/978-3-658-03986-8the problem of incomplete datasets in the hierarchical classification scenario must be solved using unsupervised missing value imputation methods due to the lack of supervised methods to deal with the hierarchical context. Thus, in this work, we propose and evaluate a supervised missing value imputa作者: 使成整體 時間: 2025-3-25 23:44 作者: Aggrandize 時間: 2025-3-26 01:57
https://doi.org/10.1007/978-3-658-01919-8ypically recorded in the Bug Tracking System, and is assigned to a developer to resolve (bug triage). Current practice of bug triage is largely a manual collaborative process, which is often time-consuming and error-prone. Predicting on the basis of past data the time to fix a newly-reported bug has作者: ESO 時間: 2025-3-26 06:50 作者: 縮短 時間: 2025-3-26 10:22
Second-Order-Faktorenanalyse (SFA)qual to the number of species. Consequently, the complexity of the classification function increases proportionally to the amount of species. To avoid this issue we propose a “hierarchical” approach that decomposes the problem into three taxonomic levels: the family, the genus, and the species level作者: vanquish 時間: 2025-3-26 13:08 作者: 賄賂 時間: 2025-3-26 20:16 作者: 刺穿 時間: 2025-3-26 22:20 作者: 壟斷 時間: 2025-3-27 01:25 作者: PLUMP 時間: 2025-3-27 08:12 作者: 偽書 時間: 2025-3-27 12:21 作者: 調味品 時間: 2025-3-27 15:28 作者: 巡回 時間: 2025-3-27 21:41 作者: 滔滔不絕地說 時間: 2025-3-27 23:19
Ensemble Diversity in Evolving Data Streamscting changes with the Page-Hinkley test. Experimental results demonstrate that the . interrater agreement, disagreement, and double fault measures, although designed to quantify diversity, provide a means of detecting changes competitive to that using classification accuracy.作者: reject 時間: 2025-3-28 05:45 作者: Statins 時間: 2025-3-28 07:10
https://doi.org/10.1007/978-3-642-35012-2dividually and combined together. We successfully use under-sampling to deal with the high skew in the data set. We find that combining the approaches significantly improves the similar results obtained by each method individually.作者: AMBI 時間: 2025-3-28 10:48
Weitere Spielarten der strukturellen Kraftal pairwise label ranking behavior. As proof of concept, we explore five datasets. The results confirm that the new task EPM can deliver interesting knowledge. The results also illustrate how the visualization of the preferences in a Preference Matrix can aid in interpreting exceptional preference subgroups.作者: Gourmet 時間: 2025-3-28 14:56 作者: 柏樹 時間: 2025-3-28 19:49 作者: HAVOC 時間: 2025-3-29 02:21 作者: 不發(fā)音 時間: 2025-3-29 04:35
Exceptional Preferences Miningal pairwise label ranking behavior. As proof of concept, we explore five datasets. The results confirm that the new task EPM can deliver interesting knowledge. The results also illustrate how the visualization of the preferences in a Preference Matrix can aid in interpreting exceptional preference subgroups.作者: BUMP 時間: 2025-3-29 07:21
Local Subgroup Discovery for Eliciting and Understanding New Structure-Odor Relationshipsewed distributions, our approach extracts the top-. unredundant subgroups interpreted as descriptive rules .. Our experiments on benchmark and olfaction datasets demonstrate the capabilities of our approach with direct applications for the perfume and flavor industries.作者: 懲罰 時間: 2025-3-29 12:31 作者: 愉快么 時間: 2025-3-29 19:01 作者: Atheroma 時間: 2025-3-29 20:51
Conference proceedings 2016he 30 full papers presented together with 5 abstracts of invited talks in this volume were carefullyreviewed and selected from 60 submissions.The conference focuses on following topics: Advances in the development and analysis of methods for discovering scienti?c knowledge, coming from machine learn作者: 魯莽 時間: 2025-3-30 03:53
Predicting Wildfiresdividually and combined together. We successfully use under-sampling to deal with the high skew in the data set. We find that combining the approaches significantly improves the similar results obtained by each method individually.作者: enmesh 時間: 2025-3-30 07:17
0302-9743 enti?c knowledge, coming from machine learning, data mining, and intelligent data analysis, as well as their application in various scienti?c domains..978-3-319-46306-3978-3-319-46307-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Ligament 時間: 2025-3-30 10:54 作者: ANN 時間: 2025-3-30 12:44 作者: NOVA 時間: 2025-3-30 18:01
InterSet: Interactive Redescription Set Explorationeveloped for interaction with possibly large redescription sets, produced on large datasets, and it enables better understanding of the underlying data and relations between attribute sets. New insights from redescription sets can be obtained through three different interaction modes based on: (i) s作者: Assault 時間: 2025-3-30 22:34 作者: 星球的光亮度 時間: 2025-3-31 02:10
