標(biāo)題: Titlebook: Discovery Science; 12th International C Jo?o Gama,Vítor Santos Costa,Pavel B. Brazdil Conference proceedings 2009 Springer-Verlag Berlin He [打印本頁] 作者: 解放 時(shí)間: 2025-3-21 16:59
書目名稱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é)科排名
作者: Repetitions 時(shí)間: 2025-3-22 00:13
Measuring Scientific Reasoning Competenciesbasis of the node links. We propose a regression inference procedure that is based on a co-training approach according to separate model trees are learned from both attribute values of labeled nodes and attribute values aggregated in the neighborhood of labeled nodes, respectively. Each model tree i作者: 伙伴 時(shí)間: 2025-3-22 01:20 作者: 就職 時(shí)間: 2025-3-22 06:13 作者: Cholagogue 時(shí)間: 2025-3-22 10:56
Modeling the Student in Sherlock II on all data sets. We show that a substantial improvement in performance is obtained using an ensemble of MICCLLR classifiers trained using different base learners. We also show that an extra gain in classification accuracy is obtained by applying AdaBoost.M1 to weak MICCLLR classifiers. Overall, ou作者: 設(shè)施 時(shí)間: 2025-3-22 16:38
Formal Approaches to Student Modelling global model adaptation. The adaptation strategy consists of building a new tree whenever a change is suspected in the region and replacing the old ones when the new trees become more accurate. This enables smooth and granular adaptation of the global model. The results from the empirical evaluatio作者: 設(shè)施 時(shí)間: 2025-3-22 20:18
Farideh Salili,Chi Yue Chiu,Ying Yi Hongstage density-based clustering for the .-partite graph constructed from the 1st-stage density-based clustering result for each timestamp network. For a given data set, CHRONICLE finds all clusters in a fixed time by using a fixed amount of memory, regardless of the number of clusters and the length 作者: Terminal 時(shí)間: 2025-3-23 00:53
The Culture and Context of Learning logical and relational space we introduce a low dimensional embedding method. The technique is amenable to skewed/non-skewed class distribution where multi-class problems such as protein fold recognition are generally characterized by highly uneven class distribution. We performed a series of exper作者: Microaneurysm 時(shí)間: 2025-3-23 03:05 作者: OUTRE 時(shí)間: 2025-3-23 06:45 作者: frenzy 時(shí)間: 2025-3-23 11:41 作者: 寬宏大量 時(shí)間: 2025-3-23 15:25
An Iterative Learning Algorithm for Within-Network Regression in the Transductive Setting,basis of the node links. We propose a regression inference procedure that is based on a co-training approach according to separate model trees are learned from both attribute values of labeled nodes and attribute values aggregated in the neighborhood of labeled nodes, respectively. Each model tree i作者: 為寵愛 時(shí)間: 2025-3-23 19:58 作者: 畫布 時(shí)間: 2025-3-24 00:43 作者: 煉油廠 時(shí)間: 2025-3-24 02:42
MICCLLR: Multiple-Instance Learning Using Class Conditional Log Likelihood Ratio, on all data sets. We show that a substantial improvement in performance is obtained using an ensemble of MICCLLR classifiers trained using different base learners. We also show that an extra gain in classification accuracy is obtained by applying AdaBoost.M1 to weak MICCLLR classifiers. Overall, ou作者: ineffectual 時(shí)間: 2025-3-24 06:47
Regression Trees from Data Streams with Drift Detection, global model adaptation. The adaptation strategy consists of building a new tree whenever a change is suspected in the region and replacing the old ones when the new trees become more accurate. This enables smooth and granular adaptation of the global model. The results from the empirical evaluatio作者: ACTIN 時(shí)間: 2025-3-24 11:54
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks,stage density-based clustering for the .-partite graph constructed from the 1st-stage density-based clustering result for each timestamp network. For a given data set, CHRONICLE finds all clusters in a fixed time by using a fixed amount of memory, regardless of the number of clusters and the length 作者: 值得贊賞 時(shí)間: 2025-3-24 16:57 作者: 暫時(shí)中止 時(shí)間: 2025-3-24 21:13 作者: musicologist 時(shí)間: 2025-3-25 01:57
Unsupervised Fuzzy Clustering for the Segmentation and Annotation of Upwelling Regions in Sea Surfaber of clusters providing an effective segmentation of the SST images whose spatial visualization of fuzzy membership closely reproduces the original images. Comparing the AP-FCM with the FCM using several validation indices shows the advantage of the AP-FCM avoiding under or over-segmented images. 作者: Pepsin 時(shí)間: 2025-3-25 04:51 作者: 災(zāi)禍 時(shí)間: 2025-3-25 11:10
978-3-642-04746-6Springer-Verlag Berlin Heidelberg 2009作者: Pseudoephedrine 時(shí)間: 2025-3-25 12:15
Student Feedback on Teaching in Schoolsactions may be deterministic or not, and full or partial sensing may be available. In the last few years, significant progress has been made, resulting in algorithms that can produce plans effectively in a variety of settings. These developments have to do with the formulation and use of general inf作者: 甜食 時(shí)間: 2025-3-25 17:33
Benedikt Wisniewski,Klaus Ziererf links at mining heterogeneous information networks with several interesting tasks, including link-based object distinction, veracity analysis, multidimensional online analytical processing of heterogeneous information networks, and rank-based clustering. Some recent results of our research that ex作者: 關(guān)心 時(shí)間: 2025-3-25 23:16
https://doi.org/10.1057/978-1-137-53901-4nge with better methods for finding and organizing Web information. However, not much of the theory, or even the current practice, of machine learning take the Web seriously. We continue to devote much effort to refining supervised learning, but the Web reality is that labeled data is hard to obtain作者: BATE 時(shí)間: 2025-3-26 00:49
Kevin Crouse,Drew H. Gitomer,Jeanette Joyceorming well on a different, yet related, domain for which no labeled data is available. This generalization across domains is a very significant challenge for many machine learning applications and arises in a variety of natural settings, including NLP tasks (document classification, sentiment analy作者: Lipohypertrophy 時(shí)間: 2025-3-26 04:19
Measuring Scientific Reasoning Competenciesech signals from microphone recordings, and so on) but costly to obtain their labels. Like supervised learning, the goal is ultimately to learn a classifier. But like unsupervised learning, the data come unlabeled. More precisely, the labels are hidden, and each of them can be revealed only at a cos作者: 和音 時(shí)間: 2025-3-26 10:51 作者: Handedness 時(shí)間: 2025-3-26 16:25 作者: 浸軟 時(shí)間: 2025-3-26 16:51
Results: Before Studying in Germany,lcohol levels) and sensory (e.g. human expert evaluation) tests. In this paper, we propose a data mining approach to predict wine preferences that is based on easily available analytical tests at the certification step. A large dataset is considered with white . samples from the Minho region of Port作者: entitle 時(shí)間: 2025-3-26 22:12
Modeling the Student in Sherlock IIinstances. Several supervised learning algorithms have been successfully adapted for the multiple-instance learning settings. We explore the adaptation of the Naive Bayes (NB) classifier and the utilization of its sufficient statistics for developing novel multiple-instance learning methods. Specifi作者: Serenity 時(shí)間: 2025-3-27 05:00 作者: 美色花錢 時(shí)間: 2025-3-27 06:59
Claus M?bus,Olaf Schr?der,Heinz-Jürgen Tholen indicators to identify historical patterns between drought and vegetation conditions indices and predict future vegetation conditions based on these patterns at multiple time steps (2, 4 and 6-week outlooks). This paper evaluates different sets of data mining techniques and various climatic indice作者: Irrepressible 時(shí)間: 2025-3-27 10:24
Formal Approaches to Student Modellingmunities. We present an algorithm which is able to learn regression trees from fast and unbounded data streams in the presence of concept drifts. To our best knowledge there is no other algorithm for incremental learning regression trees equipped with change detection abilities. The FIRT-DD algorith作者: Cholesterol 時(shí)間: 2025-3-27 17:10
Re-Writing Cartesian Student Models .. Then, we present an algorithm that finds all frequent bipartite episodes from an input sequence without duplication in .(|Σ| ·.) time per an episode and in .(|Σ|..) space, where Σ is an alphabet, . is total input size of ., and . is the length of .. Finally, we give experimental results on artif作者: 責(zé)難 時(shí)間: 2025-3-27 19:49
Farideh Salili,Chi Yue Chiu,Ying Yi Hongr time-evolving communities in dynamic networks. In this paper, we study the problem of finding time-evolving communities such that each community freely forms, evolves, and dissolves for any time period. Although the previous .-partite graph based methods are quite effective for discovering such co作者: expository 時(shí)間: 2025-3-28 01:54
The Culture and Context of Learningccurate solution to a multi-class problem can be obtained by using a logic based learning method. In this paper we present a novel logic based approach to solve challenging multi-class classification problems. Our technique is based on the use of large margin methods in conjunction with the kernels 作者: CRANK 時(shí)間: 2025-3-28 05:48
https://doi.org/10.1007/978-1-4615-1273-8algorithms. In fact, centrality measures derived from networks generated from the data allow ranking the instances to find out the best ones to be presented to a human expert for manual classification. We discuss how to rank the instances based on the network vertex properties of closeness and betwe作者: 記憶法 時(shí)間: 2025-3-28 06:54 作者: Acquired 時(shí)間: 2025-3-28 10:38
Methods of Teaching and Learning (I), simultaneously allows the determination of the number of clusters. The composed algorithm, Anomalous Pattern Fuzzy Clustering (AP-FCM), is applied in the segmentation of Sea Surface Temperature (SST) images for the identification of Coastal Upwelling..A set of features are constructed from the AP-F作者: 徹底明白 時(shí)間: 2025-3-28 18:05
University Development and Administrationssive developers understand the structures and the components of open source programs even if documents about them are not provided sufficiently. Our method consists of two phases: (1) producing a mapping between the source files and the emails, and (2) constructing a lattice from the produced mappi作者: sacrum 時(shí)間: 2025-3-28 20:50
Discovery Science978-3-642-04747-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 羊齒 時(shí)間: 2025-3-28 23:36 作者: 退出可食用 時(shí)間: 2025-3-29 03:50
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281049.jpg作者: oblique 時(shí)間: 2025-3-29 08:15
Inference and Learning in Planning (Extended Abstract),actions may be deterministic or not, and full or partial sensing may be available. In the last few years, significant progress has been made, resulting in algorithms that can produce plans effectively in a variety of settings. These developments have to do with the formulation and use of general inf作者: 喚起 時(shí)間: 2025-3-29 14:13 作者: Flounder 時(shí)間: 2025-3-29 18:13 作者: 山羊 時(shí)間: 2025-3-29 21:00
Learning and Domain Adaptation,orming well on a different, yet related, domain for which no labeled data is available. This generalization across domains is a very significant challenge for many machine learning applications and arises in a variety of natural settings, including NLP tasks (document classification, sentiment analy作者: epicardium 時(shí)間: 2025-3-30 00:40 作者: 迎合 時(shí)間: 2025-3-30 06:38
An Iterative Learning Algorithm for Within-Network Regression in the Transductive Setting,nce consist of entities associated with nodes for which labels are known and interlinked with nodes for which labels must be estimated. The premise of this work is that many networked datasets are characterized by a form of autocorrelation where values of the response variable in a node depend on va作者: 野蠻 時(shí)間: 2025-3-30 11:19 作者: Ballad 時(shí)間: 2025-3-30 13:24 作者: 確定的事 時(shí)間: 2025-3-30 18:11 作者: incision 時(shí)間: 2025-3-30 22:30 作者: interrupt 時(shí)間: 2025-3-31 04:01
Algorithm and Feature Selection for VegOut: A Vegetation Condition Prediction Tool,n indicators to identify historical patterns between drought and vegetation conditions indices and predict future vegetation conditions based on these patterns at multiple time steps (2, 4 and 6-week outlooks). This paper evaluates different sets of data mining techniques and various climatic indice作者: Credence 時(shí)間: 2025-3-31 07:36 作者: Lipohypertrophy 時(shí)間: 2025-3-31 11:49
Mining Frequent Bipartite Episode from Event Sequences, .. Then, we present an algorithm that finds all frequent bipartite episodes from an input sequence without duplication in .(|Σ| ·.) time per an episode and in .(|Σ|..) space, where Σ is an alphabet, . is total input size of ., and . is the length of .. Finally, we give experimental results on artif作者: 放逐 時(shí)間: 2025-3-31 17:04 作者: Urgency 時(shí)間: 2025-3-31 18:06
Learning Large Margin First Order Decision Lists for Multi-Class Classification,ccurate solution to a multi-class problem can be obtained by using a logic based learning method. In this paper we present a novel logic based approach to solve challenging multi-class classification problems. Our technique is based on the use of large margin methods in conjunction with the kernels 作者: 鬧劇 時(shí)間: 2025-4-1 00:54 作者: Feedback 時(shí)間: 2025-4-1 04:18
Player Modeling for Intelligent Difficulty Adjustment,of the type from short traces of gameplay. An important ingredient of video games is to challenge players by providing them with tasks of appropriate and increasing difficulty. How this difficulty should be chosen and increase over time strongly depends on the ability, experience, perception and lea作者: Grandstand 時(shí)間: 2025-4-1 07:03 作者: Priapism 時(shí)間: 2025-4-1 13:03
Discovering the Structures of Open Source Programs from Their Developer Mailing Lists,ssive developers understand the structures and the components of open source programs even if documents about them are not provided sufficiently. Our method consists of two phases: (1) producing a mapping between the source files and the emails, and (2) constructing a lattice from the produced mappi作者: 語言學(xué) 時(shí)間: 2025-4-1 17:00
Kevin Crouse,Drew H. Gitomer,Jeanette Joycen composition)..The learning theory community has only recently started to analyze domain adaptation problems. In the talk, I will overview some recent theoretical models and results regarding domain adaptation..This talk is based on joint works with Mehryar Mohri and Afshin Rostamizadeh.
