標題: Titlebook: Discovery Science; 13th International C Bernhard Pfahringer,Geoff Holmes,Achim Hoffmann Conference proceedings 2010 Springer Berlin Heidelb [打印本頁] 作者: Obsolescent 時間: 2025-3-21 17:17
書目名稱Discovery Science影響因子(影響力)
書目名稱Discovery Science影響因子(影響力)學(xué)科排名
書目名稱Discovery Science網(wǎng)絡(luò)公開度
書目名稱Discovery Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discovery Science被引頻次
書目名稱Discovery Science被引頻次學(xué)科排名
書目名稱Discovery Science年度引用
書目名稱Discovery Science年度引用學(xué)科排名
書目名稱Discovery Science讀者反饋
書目名稱Discovery Science讀者反饋學(xué)科排名
作者: Exploit 時間: 2025-3-21 23:17
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 作者: 半身雕像 時間: 2025-3-22 02:39
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作者: Invertebrate 時間: 2025-3-22 06:40
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作者: Hdl348 時間: 2025-3-22 12:12
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作者: ECG769 時間: 2025-3-22 13:37 作者: ECG769 時間: 2025-3-22 17:54 作者: seroma 時間: 2025-3-22 22:26 作者: 倔強一點 時間: 2025-3-23 05:24
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作者: Hyperalgesia 時間: 2025-3-23 08:01
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作者: 泛濫 時間: 2025-3-23 13:25 作者: 言外之意 時間: 2025-3-23 15:56
Integer Linear Programming Models for Constrained Clustering,t to most approaches to constrained clustering, we do not constrain the way observations can be grouped into clusters, but the way candidate clusters can be combined into suitable clusterings. The constraints may concern the type of clustering (e.g., complete clusterings, overlapping or encompassing作者: 遺傳 時間: 2025-3-23 21:48 作者: Stress-Fracture 時間: 2025-3-24 01:29 作者: 投射 時間: 2025-3-24 06:21
Graph Classification Based on Optimizing Graph Spectra,vel graph kernel, called SPEC, based on graph spectra and the Interlace Theorem, as well as an algorithm, called OPTSPEC, to optimize the SPEC kernel used in an SVM for graph classification. The fundamental performance of the method is evaluated using artificial datasets, and its practicality confir作者: Little 時間: 2025-3-24 10:32
Algorithm for Detecting Significant Locations from Raw GPS Data,nt locations from raw GPS data is the first essential step of algorithms designed for location-aware applications. Assuming that a location is significant if users spend a certain time around that area, most current algorithms compare spatial/temporal variables, such as stay duration and a roaming d作者: 草率男 時間: 2025-3-24 11:25 作者: 必死 時間: 2025-3-24 16:04
Gaussian Clusters and Noise: An Approach Based on the Minimum Description Length Principle,rmally distributed clusters and a cluster with a uniform distribution in an axis-aligned rectangular box. The uniform component extends the practical usability of the model e.g. in the presence of noise, and using the MDL principle for the model selection makes comparing the quality of clusterings w作者: ALB 時間: 2025-3-24 19:10 作者: alcohol-abuse 時間: 2025-3-25 00:51 作者: DAMN 時間: 2025-3-25 04:42
Unternehmensethik und strategische Planunge 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 作者: maudtin 時間: 2025-3-25 09:41 作者: Trigger-Point 時間: 2025-3-25 14:36
https://doi.org/10.1007/978-3-662-41482-8 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作者: 網(wǎng)絡(luò)添麻煩 時間: 2025-3-25 16:40
Strategische Unternehmungsführung 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作者: fabricate 時間: 2025-3-25 22:25 作者: 巧思 時間: 2025-3-26 04:08 作者: harangue 時間: 2025-3-26 07:32 作者: Relinquish 時間: 2025-3-26 08:53 作者: Cerebrovascular 時間: 2025-3-26 16:32
Abby Ghobadian,Nicholas O’Regan,Howard Vineyt 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作者: charisma 時間: 2025-3-26 17:23 作者: 時代 時間: 2025-3-26 21:40
Zoe J. Radnor,Hannah Noke,Tudor Rickardst to most approaches to constrained clustering, we do not constrain the way observations can be grouped into clusters, but the way candidate clusters can be combined into suitable clusterings. The constraints may concern the type of clustering (e.g., complete clusterings, overlapping or encompassing作者: 貿(mào)易 時間: 2025-3-27 02:46 作者: 職業(yè) 時間: 2025-3-27 06:17
Relative Morse Theory of Nonproper Functionscorrelation rate amongst the items that constitute a given pattern since they are mainly interested in appearance frequency. In this situation, many correlation measures have been proposed in order to convey information on the dependencies within sets of items. In this work, we adopt the correlation作者: 倫理學(xué) 時間: 2025-3-27 11:40 作者: observatory 時間: 2025-3-27 13:59
Dramatis Personae and the Main Theoremnt locations from raw GPS data is the first essential step of algorithms designed for location-aware applications. Assuming that a location is significant if users spend a certain time around that area, most current algorithms compare spatial/temporal variables, such as stay duration and a roaming d作者: Minikin 時間: 2025-3-27 19:31
Eigene Ergebnisse und Erfahrungen,tral area of natural science research concerns reactions: how entities in a scientific domain interact to generate new entities. Classic AI research due to Valdés-Pérez, ?ytkow, Langley and Simon has shown that many scientific discovery tasks that concern reaction models can be formalized as a matri作者: forebear 時間: 2025-3-28 01:18
Rotationally Invariant Bark Recognitionrmally distributed clusters and a cluster with a uniform distribution in an axis-aligned rectangular box. The uniform component extends the practical usability of the model e.g. in the presence of noise, and using the MDL principle for the model selection makes comparing the quality of clusterings w作者: Expand 時間: 2025-3-28 02:15 作者: 口訣 時間: 2025-3-28 06:43
https://doi.org/10.1007/978-3-642-16184-1cloud computing; clustering; cognition; collaborative science; data mining; human-machine interaction; kno作者: 翻動 時間: 2025-3-28 12:36
978-3-642-16183-4Springer Berlin Heidelberg 2010作者: Cerebrovascular 時間: 2025-3-28 17:20 作者: Limousine 時間: 2025-3-28 21:54 作者: 長處 時間: 2025-3-29 01:54
Discovery Science978-3-642-16184-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 變色龍 時間: 2025-3-29 03:06 作者: 解脫 時間: 2025-3-29 07:41 作者: transient-pain 時間: 2025-3-29 14:00
https://doi.org/10.1007/978-3-662-41482-8iours to be produced with few observations, the artificial experimenter has been employed in a laboratory setting, where it selected experiments for a human scientist to perform, to investigate the optical absorbance properties of NADH.作者: 含糊其辭 時間: 2025-3-29 16:23 作者: 祖?zhèn)?nbsp; 時間: 2025-3-29 23:20 作者: 雜色 時間: 2025-3-30 02:29
Zoe J. Radnor,Hannah Noke,Tudor Rickardshe system synthesizes minimal or semi-minimal rule sets of CAs. This paper reports experimental results on learning several OCAs for fundamental formal languages including sets of balanced parentheses and palindromes as well as the set {...... | .?≥?1}.作者: rheumatism 時間: 2025-3-30 05:23 作者: GUISE 時間: 2025-3-30 09:24
Abby Ghobadian,Nicholas O’Regan,Howard Vineytting with a limited buffer capacity and a constant document batch size, it is possible to process roughly 2.5 documents per second which corresponds to approximately 25% of the entire blogosphere rate and should be sufficient for most real-life applications.作者: expository 時間: 2025-3-30 14:52 作者: Vertical 時間: 2025-3-30 19:28 作者: Crepitus 時間: 2025-3-30 21:03
Abdessalem Bouzaieni,Salvatore Tabboneining complexity. We experimentally evaluate the algorithm with Hoeffding trees, as an example for incremental learners where the classifier adaptation is trivial, and with SVMs, where we employ an adaptation strategy based on adapted caching and weight reuse, which guarantees that the learned model作者: beta-cells 時間: 2025-3-31 02:33 作者: Colonnade 時間: 2025-3-31 06:15
An Artificial Experimenter for Enzymatic Response Characterisation,iours to be produced with few observations, the artificial experimenter has been employed in a laboratory setting, where it selected experiments for a human scientist to perform, to investigate the optical absorbance properties of NADH.作者: Etching 時間: 2025-3-31 11:58 作者: Encephalitis 時間: 2025-3-31 14:53 作者: BOOST 時間: 2025-3-31 19:50
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages,he system synthesizes minimal or semi-minimal rule sets of CAs. This paper reports experimental results on learning several OCAs for fundamental formal languages including sets of balanced parentheses and palindromes as well as the set {...... | .?≥?1}.作者: Meager 時間: 2025-4-1 01:15
Discovery of Super-Mediators of Information Diffusion in Social Networks,terestingly enough that when the high ranked super-mediators are different from the top ranked influential nodes, which is the case when the diffusion probability is small, those super-mediators become the high ranked influential nodes when the diffusion probability becomes larger. This finding will作者: LAST 時間: 2025-4-1 02:34
Efficient Visualization of Document Streams,tting with a limited buffer capacity and a constant document batch size, it is possible to process roughly 2.5 documents per second which corresponds to approximately 25% of the entire blogosphere rate and should be sufficient for most real-life applications.作者: Receive 時間: 2025-4-1 06:48
Bridging Conjunctive and Disjunctive Search Spaces for Mining a New Concise and Exact Representatiooffer its conjunctive, disjunctive and negative supports. To prove the utility of our approach, we undertake an empirical study on several benchmark data sets that are commonly used within the data mining community.作者: 小爭吵 時間: 2025-4-1 12:08
Discovery of Conservation Laws via Matrix Search,lerator data of the type that are produced by the Large Hadron Collider in Geneva. It matches the important Standard Model of particles that physicists have constructed through decades of research: the program rediscovers Standard Model conservation laws and the corresponding particle families of ba作者: upstart 時間: 2025-4-1 18:11
Exploiting Code Redundancies in ECOC,ining complexity. We experimentally evaluate the algorithm with Hoeffding trees, as an example for incremental learners where the classifier adaptation is trivial, and with SVMs, where we employ an adaptation strategy based on adapted caching and weight reuse, which guarantees that the learned model
