標題: Titlebook: Discovery Science; 10th International C Vincent Corruble,Masayuki Takeda,Einoshin Suzuki Conference proceedings 2007 Springer-Verlag Berlin [打印本頁] 作者: 五個 時間: 2025-3-21 19:21
書目名稱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 21:32 作者: Comprise 時間: 2025-3-22 01:30
Discovery Science978-3-540-75488-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: archenemy 時間: 2025-3-22 05:19 作者: angina-pectoris 時間: 2025-3-22 11:30
A Hilbert Space Embedding for DistributionsWhile kernel methods are the basis of many popular techniques in supervised learning, they are less commonly used in testing, estimation, and analysis of probability distributions, where information theoretic approaches rule the roost. However it becomes difficult to estimate mutual information or entropy if the data are high dimensional.作者: 不可思議 時間: 2025-3-22 15:05
Studies in Indian Mathematics and Astronomy The project “Cyber Infrastructure for the Information-explosion Era” is a six-year project from 2005 to 2010 supported by Grant-in-Aid for Scientific Research on Priority Areas from the Ministry of Education, Culture, Sports, Science and Technology (MEXT) of Japan. The project aims to establish the作者: 不可思議 時間: 2025-3-22 19:39 作者: finale 時間: 2025-3-23 00:50 作者: Bumptious 時間: 2025-3-23 04:42 作者: 謊言 時間: 2025-3-23 05:41
Family Influences on A. E. Garrod’s Thinkingtation, and scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal (or closed) graph mining problem for the general class of geometri作者: 骨 時間: 2025-3-23 12:53
Studies in International Businessreordering the original set of rules according to the error rates obtained on a set of training examples. This is done iteratively, starting from the original set of rules. After obtaining . models these are used as an ensemble for classifying new cases. The net effect of this approach is that the o作者: CLEFT 時間: 2025-3-23 14:13
Patrick F. R. Artisien,Peter J. Buckleyem) set mining. Gunopulos et al. [10] have shown that finding a maximum frequent set is .-hard. In this paper I show that the minimization problem is also .-hard. As a next step I investigate whether these problems can be approximated. While a simple greedy algorithm turns out to approximate a minim作者: Countermand 時間: 2025-3-23 20:13
Hafiz Mirza,Peter J. Buckley,John R. Sparkesnts classification, etc. The goal is to efficiently maintain homogenous and well-separated clusters as new data are inserted or existing data are removed. We propose a framework called .based solely on pairwise dissimilarities among all pairs of data and on cluster dominance. In experiments on bench作者: 變異 時間: 2025-3-23 23:38 作者: inconceivable 時間: 2025-3-24 05:13 作者: entitle 時間: 2025-3-24 09:01
Shrawan Kumar,Karl-Hermann Neebng useful information from a huge amount of available content becomes a time consuming process. In this paper, we focus on user modeling for personalization to recommend content relevant to user interests. Techniques used for association rules in deriving user profiles are exploited for discovering 作者: pulmonary 時間: 2025-3-24 11:39 作者: 新字 時間: 2025-3-24 15:55 作者: 補角 時間: 2025-3-24 20:44 作者: 不持續(xù)就爆 時間: 2025-3-25 00:51 作者: V洗浴 時間: 2025-3-25 06:06
Aesthetic Fallacies in Perspective. But few methods can exploit the full potential of clausal logic and abduce non-ground explanations with indefinite answers. This paper shows how the consequence finding method of Skip Ordered Linear (SOL) resolution can overcome the limitations of existing systems by proposing a method that is sou作者: BOGUS 時間: 2025-3-25 08:48
The Frames and Relational Aestheticsterests. Since even experts’ knowledge is likely to be incomplete, important findings or associations among key concepts may remain unnoticed in the flood of information. This paper brings and extends a formal model from information retrieval in order to discover those implicit, hidden knowledge. Fo作者: 傲慢物 時間: 2025-3-25 12:06
Imperial preference: a quantitative analysiscal examples. We propose a . measure to assess researchers on their mentoring abilities. Our approach quantifies benefits bestowed by researchers upon their students by characterizing the publication dynamics of research advisor-student interactions in author collaboration networks. We show that our作者: Notify 時間: 2025-3-25 19:54 作者: Ethics 時間: 2025-3-25 20:33
Challenge for Info-plosion The project “Cyber Infrastructure for the Information-explosion Era” is a six-year project from 2005 to 2010 supported by Grant-in-Aid for Scientific Research on Priority Areas from the Ministry of Education, Culture, Sports, Science and Technology (MEXT) of Japan. The project aims to establish the作者: 字的誤用 時間: 2025-3-26 02:57
Machine Learning in Ecosystem Informaticscosystem sciences. The ecosystem sciences are in the midst of a revolution driven by a combination of emerging technologies for improved sensing and the critical need for better science to help manage global climate change. This paper describes several initiatives at Oregon State University in ecosy作者: chalice 時間: 2025-3-26 05:13
Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creas ‘holy.’ At any time, given some agent’s current coding capabilities, part of the data is compressible by a short and hopefully fast program / description / explanation / world model. In the agent’s subjective eyes, such data is more regular and more . than other data. It is well-known that knowled作者: Vulvodynia 時間: 2025-3-26 08:47
A Theory of Similarity Functions for Learning and Clustering of sufficient conditions for a kernel to be useful for a given learning problem. However, while a kernel can be thought of as just a pairwise similarity function that satisfies additional mathematical properties, this theory requires viewing kernels as implicit (and often difficult to characterize)作者: LATE 時間: 2025-3-26 16:09 作者: Pseudoephedrine 時間: 2025-3-26 19:13 作者: FIN 時間: 2025-3-26 22:59
On Approximating Minimum Infrequent and Maximum Frequent Setsem) set mining. Gunopulos et al. [10] have shown that finding a maximum frequent set is .-hard. In this paper I show that the minimization problem is also .-hard. As a next step I investigate whether these problems can be approximated. While a simple greedy algorithm turns out to approximate a minim作者: Insul島 時間: 2025-3-27 01:08
A Partially Dynamic Clustering Algorithm for Data Insertion and Removalnts classification, etc. The goal is to efficiently maintain homogenous and well-separated clusters as new data are inserted or existing data are removed. We propose a framework called .based solely on pairwise dissimilarities among all pairs of data and on cluster dominance. In experiments on bench作者: 不安 時間: 2025-3-27 05:43
Positivism Against Constructivism: A Network Game to Learn Epistemologypistemology, as traditional science teaching is mostly dogmatic and based on contents. Previous studies show that pupils, science students and teachers mostly own positivist and realist spontaneous conceptions of science and scientific discovery. Here, we present the evaluation of the didactic impac作者: 折磨 時間: 2025-3-27 12:36
Learning Locally Weighted C4.4 for Class Probability Estimationct marketing, we often need to deploy different promotion strategies to customers with different likelihood (probability) of buying some products. When our learning task is to build a model with accurate class probability estimations, C4.4 is the most popular one for achieving this task because of i作者: 幻影 時間: 2025-3-27 14:54 作者: 啜泣 時間: 2025-3-27 19:39 作者: 微不足道 時間: 2025-3-28 01:00 作者: Maximizer 時間: 2025-3-28 02:14 作者: 極為憤怒 時間: 2025-3-28 07:08 作者: BAIL 時間: 2025-3-28 12:14
A Consequence Finding Approach for Full Clausal Abduction. But few methods can exploit the full potential of clausal logic and abduce non-ground explanations with indefinite answers. This paper shows how the consequence finding method of Skip Ordered Linear (SOL) resolution can overcome the limitations of existing systems by proposing a method that is sou作者: 敲竹杠 時間: 2025-3-28 15:19
Literature-Based Discovery by an Enhanced Information Retrieval Modelterests. Since even experts’ knowledge is likely to be incomplete, important findings or associations among key concepts may remain unnoticed in the flood of information. This paper brings and extends a formal model from information retrieval in order to discover those implicit, hidden knowledge. Fo作者: 煩躁的女人 時間: 2025-3-28 19:22
Discovering Mentorship Information from Author Collaboration Networkscal examples. We propose a . measure to assess researchers on their mentoring abilities. Our approach quantifies benefits bestowed by researchers upon their students by characterizing the publication dynamics of research advisor-student interactions in author collaboration networks. We show that our作者: 禁止 時間: 2025-3-29 01:23 作者: 得體 時間: 2025-3-29 03:18 作者: jarring 時間: 2025-3-29 08:33 作者: 易達到 時間: 2025-3-29 13:28 作者: 繁重 時間: 2025-3-29 17:13 作者: 吊胃口 時間: 2025-3-29 21:27
Machine Learning in Ecosystem Informaticsof linear gaussian dynamic Bayesian networks to automated anomaly detection in temperature data streams. Finally, the paper describes two educational activities: (a) a summer institute in ecosystem informatics and (b) an interdisciplinary Ph.D. program in Ecosystem Informatics for mathematics, computer science, and the ecosystem sciences.作者: 埋伏 時間: 2025-3-30 03:46 作者: declamation 時間: 2025-3-30 06:23 作者: Ardent 時間: 2025-3-30 09:11
0302-9743 1–4, 2007. The main objective of the Discovery Science (DS) conference series is to p- vide an open forum for intensive discussions and the exchange of new ideas and information among researchers working in the area of automating scienti?c d- covery or working on tools for supporting the human proce作者: lobster 時間: 2025-3-30 12:26
Patrick F. R. Artisien,Peter J. Buckleyalso .-hard. As a next step I investigate whether these problems can be approximated. While a simple greedy algorithm turns out to approximate a minimum infrequent set within a logarithmic factor one can show that there is no such algorithm for the maximization problem.作者: 敲竹杠 時間: 2025-3-30 20:02
Hafiz Mirza,Peter J. Buckley,John R. Sparkesved. We propose a framework called .based solely on pairwise dissimilarities among all pairs of data and on cluster dominance. In experiments on benchmark data sets, we show improvements in the performance of clustering solution in terms of quality and computational complexity.作者: 藕床生厭倦 時間: 2025-3-30 23:53
Canadian Military Geography 1867-2002tly reduces the number of trials. In addition, we apply thinning-out to the discovery of good physical motions by legged robots in a simulation environment. By using thinning-out, our virtual robots can discover sophisticated motions that is much different from the initial motion in a reasonable amount of trials.作者: 分發(fā) 時間: 2025-3-31 01:28
The Frames and Relational Aestheticstring that is in an equivalence class with a high degree of alienness. The proposed method is unsupervised, language independent, and scalable. Computational experiments conducted on data collected from Japanese web forums show that the method successfully discovers spams.作者: occurrence 時間: 2025-3-31 06:40 作者: 不如樂死去 時間: 2025-3-31 13:05 作者: 吹牛大王 時間: 2025-3-31 17:11
Time and Space Efficient Discovery of Maximal Geometric Graphs for the class of maximal patterns, we present ., MaxGeo, . in a given input geometric graph without duplicates. This is the first result establishing the output-sensitive complexity of closed graph mining for geometric graphs. We also show that the frequent graph mining problem is also solvable in polynomial delay and polynomial time.作者: 明智的人 時間: 2025-3-31 20:47 作者: Range-Of-Motion 時間: 2025-3-31 23:06 作者: NIP 時間: 2025-4-1 01:56 作者: Brain-Imaging 時間: 2025-4-1 09:08 作者: inspired 時間: 2025-4-1 13:22
Conference proceedings 2007 The main objective of the Discovery Science (DS) conference series is to p- vide an open forum for intensive discussions and the exchange of new ideas and information among researchers working in the area of automating scienti?c d- covery or working on tools for supporting the human process of disc作者: Parabola 時間: 2025-4-1 14:33
