標(biāo)題: Titlebook: Discovery Science; Third International Setsuo Arikawa,Shinichi Morishita Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 200 [打印本頁] 作者: 櫥柜 時間: 2025-3-21 18:31
書目名稱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é)科排名
作者: originality 時間: 2025-3-21 23:30
Alice Wong Ph. D.,Gino Cortopassi Ph. D.wn to be NP-complete.We generalize the problem to an optimization problem, and give a practical algorithm to solve it exactly. Our algorithm uses pruning heuristic and subsequence automata, and can find the best subsequence. We show some experiments, that convinced us the approach is quite promising.作者: incisive 時間: 2025-3-22 02:09 作者: 水槽 時間: 2025-3-22 07:02
https://doi.org/10.1007/3-540-44418-1algorithms; data mining; database; learning; logic; programming; science; visualization作者: infinite 時間: 2025-3-22 09:19
978-3-540-41352-3Springer-Verlag Berlin Heidelberg 2000作者: 深陷 時間: 2025-3-22 14:50
A Practical Algorithm to Find the Best Subsequence Patternswn to be NP-complete.We generalize the problem to an optimization problem, and give a practical algorithm to solve it exactly. Our algorithm uses pruning heuristic and subsequence automata, and can find the best subsequence. We show some experiments, that convinced us the approach is quite promising.作者: 深陷 時間: 2025-3-22 17:54 作者: 使聲音降低 時間: 2025-3-22 22:53
Prologue: The Medieval Atlantic Oceanhased at the same time. The problem is to find pairs, or perhaps larger sets, of items that frequently appear together in baskets. We mention the principal approaches to efficient, large-scale discovery of the frequent itemsets, including the a-priori algorithm, improvements using hashing, and one- 作者: 無能的人 時間: 2025-3-23 03:24
Probability Concepts in Quantum Mechanicsinformation (such as “80have hepatitis”), and default information (such as “patients with pneumonia typically have fever”). The doctor may want to make decisions regarding a particular patient, using the KB in some principled way. To do this, it is often useful for the doctor to assign a numerical “作者: FUSE 時間: 2025-3-23 08:21 作者: 膠狀 時間: 2025-3-23 12:51 作者: 恫嚇 時間: 2025-3-23 14:10 作者: COLON 時間: 2025-3-23 19:20 作者: Gourmet 時間: 2025-3-24 00:01 作者: hemoglobin 時間: 2025-3-24 05:47
Studies in the Sociology of Populationare represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation algorithm for this problem. In this algorithm, the original problem is reduced to the set cover problem and a well-known greedy algorithm for th作者: BLUSH 時間: 2025-3-24 07:45
Cellular Aging / Replicative Senescencee), to name a few. Thus, efficiently finding characteristic substructures in a graph will be a useful technique in many important KDD/ML applications. However, graph pattern matching is a hard problem. We propose a machine learning technique called Graph- Based Induction (GBI) that efficiently extra作者: 碎石頭 時間: 2025-3-24 13:30
https://doi.org/10.1007/978-3-642-59916-3rks by another writer as ., to find expressions that appear frequently in the positive examples but do not so in the negative examples. It is considered as a special case of . from textual data, in which only . are considered. One reasonable approach is to create a list of substrings arranged in the作者: Anticoagulants 時間: 2025-3-24 17:12 作者: 國家明智 時間: 2025-3-24 22:04 作者: 向宇宙 時間: 2025-3-25 02:37 作者: 揭穿真相 時間: 2025-3-25 04:33
https://doi.org/10.1007/978-3-030-02206-8We also introduce a computationally efficient technique based on ordered-attributes. It reduces search space significantly and finds valid and general rules for single nodes in the networks. Empirical results are shown.作者: 喚起 時間: 2025-3-25 11:27
https://doi.org/10.1007/978-3-319-03605-2nsider is the one described uniformly in terms of a distance over strings. Firstly, we introduce a notion of a recursively generable distance over strings, and define a k-neighbor closure of a language L as the collection of strings each of which is at most k distant from some string in L. Then we d作者: 排名真古怪 時間: 2025-3-25 11:44
https://doi.org/10.1007/978-3-319-03605-2nalyzing such a velocity distribution via a multivariate Maxwellian mixture model whose each component represents each of the multiple peaks. The parameters of the model are determined through the EM algorithm. For an auto judgment of preferable number of components of the mixture model, we introduc作者: 預(yù)示 時間: 2025-3-25 16:32
https://doi.org/10.1007/978-3-319-03605-2two steps. The first step is regression analysis. The second step is rule extraction from the regression formula obtained by the regression analysis. In this paper, we use nonparametric regression analysis as a regression analysis, since there are not sufficient data in knowledge discovery from fMRI作者: 不連貫 時間: 2025-3-25 20:57
Peter M. Winter,Leonard L. Firestones sometimes dificult to make complete experimental planning in which hypotheses guiding the experiments are established prior to executing the experiments. Even if the situation stands, experts in the field systematically organize their experimental processes. We propose Searching Experimental Schem作者: 鉆孔 時間: 2025-3-26 02:47 作者: 外露 時間: 2025-3-26 06:31
Setsuo Arikawa,Shinichi MorishitaIncludes supplementary material: 作者: 他去就結(jié)束 時間: 2025-3-26 11:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281061.jpg作者: deactivate 時間: 2025-3-26 13:42 作者: EWER 時間: 2025-3-26 18:29
Degrees of belief, random worlds, and maximum entropyinformation (such as “80have hepatitis”), and default information (such as “patients with pneumonia typically have fever”). The doctor may want to make decisions regarding a particular patient, using the KB in some principled way. To do this, it is often useful for the doctor to assign a numerical “作者: INTER 時間: 2025-3-26 21:26 作者: 馬籠頭 時間: 2025-3-27 01:09 作者: Liability 時間: 2025-3-27 07:05
A Unifying Approach to HTML Wrapper Representation and Learningn. This calls for representation formalisms that match the World Wide Web reality and for learning approaches and learnability results that apply to these formalisms..The concept of elementary formal systems is appropriately generalized to allow for the representation of wrapper classes which are re作者: ordain 時間: 2025-3-27 09:57
Discovery of Web Communities Based on the Co-occurrence of Referenceson interest. Discovery of such community is expected to assist users’ information retrieval from theWeb. The method proposed in this paper is based on the assumption that hyperlinks to related Web pages often co-occur. Relations of Web pages are detected by the co-occurrence of hyperlinks on the pag作者: 怒目而視 時間: 2025-3-27 14:28
Clustering and Visualization of Large Protein Sequence Databases by Means of an Extension of the Selelf-Organizing Map (SOM) is used in this work for the clustering of all the 77,977 protein sequences of the SWISS-PROT database, release 37. In this method, unlike in some previous ones, the data sequences are not converted into histogram vectors in order to perform the clustering. Instead, a collec作者: 問到了燒瓶 時間: 2025-3-27 19:03
A Simple Greedy Algorithm for Finding Functional Relations: Efficient Implementation and Average Casare represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation algorithm for this problem. In this algorithm, the original problem is reduced to the set cover problem and a well-known greedy algorithm for th作者: Enliven 時間: 2025-3-28 00:13 作者: lipids 時間: 2025-3-28 02:24 作者: 針葉類的樹 時間: 2025-3-28 09:22
Classifying Scenarios using Belief Decision Trees decision tree technique and the belief function theory as understood in the transferable belief model in order to find the classes of the scenarios (of a given problem) that may happen in the future. Two major phases will be ensured: the construction of the belief decision tree representing the sce作者: 花費(fèi) 時間: 2025-3-28 13:49
A Practical Algorithm to Find the Best Subsequence Patternswn to be NP-complete.We generalize the problem to an optimization problem, and give a practical algorithm to solve it exactly. Our algorithm uses pruning heuristic and subsequence automata, and can find the best subsequence. We show some experiments, that convinced us the approach is quite promising作者: Defense 時間: 2025-3-28 15:45 作者: Rct393 時間: 2025-3-28 21:36
Computationally Efficient Heuristics for If-Then Rule Extraction from Feed-Forward Neural NetworksWe also introduce a computationally efficient technique based on ordered-attributes. It reduces search space significantly and finds valid and general rules for single nodes in the networks. Empirical results are shown.作者: 管理員 時間: 2025-3-29 01:26
Language Learning with a Neighbor Systemnsider is the one described uniformly in terms of a distance over strings. Firstly, we introduce a notion of a recursively generable distance over strings, and define a k-neighbor closure of a language L as the collection of strings each of which is at most k distant from some string in L. Then we d作者: 討厭 時間: 2025-3-29 06:59 作者: EXTOL 時間: 2025-3-29 11:09
Knowledge Discovery from fMRI Brain Images by Logical Regression Analysistwo steps. The first step is regression analysis. The second step is rule extraction from the regression formula obtained by the regression analysis. In this paper, we use nonparametric regression analysis as a regression analysis, since there are not sufficient data in knowledge discovery from fMRI作者: Condyle 時間: 2025-3-29 12:59
Human Discovery Processes Based on Searching Experiments in Virtual Psychological Research Environmes sometimes dificult to make complete experimental planning in which hypotheses guiding the experiments are established prior to executing the experiments. Even if the situation stands, experts in the field systematically organize their experimental processes. We propose Searching Experimental Schem作者: 條約 時間: 2025-3-29 18:43
Prediction of Binding Affinities for Protein-Ligand Complexes with Neural Network Modelsrmation of ligandtarget complexes is typical for biologically active compounds, including activators and inhibitors of various enzymes. Prediction of the dissociation constant (Kd) of protein-ligand complex is often used as a scoring function for the modeled complexes and there are many approaches i作者: TAP 時間: 2025-3-29 23:29 作者: 可觸知 時間: 2025-3-30 01:41 作者: 閑逛 時間: 2025-3-30 06:08 作者: molest 時間: 2025-3-30 11:34 作者: 成績上升 時間: 2025-3-30 13:48
Knowledge Discovery from fMRI Brain Images by Logical Regression Analysis brain images. The algorithm has been applied to two experimental tasks, finger tapping and calculation. Experimental results show that the algorithm has rediscovered well-known facts and discovered new facts.作者: 考得 時間: 2025-3-30 16:31 作者: ORBIT 時間: 2025-3-30 20:53 作者: Thyroiditis 時間: 2025-3-31 04:37 作者: Proclaim 時間: 2025-3-31 06:31 作者: amnesia 時間: 2025-3-31 09:36 作者: FECK 時間: 2025-3-31 15:42 作者: CLAMP 時間: 2025-3-31 19:10
Cellular Aging / Replicative Senescences almost linear with the size of graph. We, further, show that GBI can effiectively be applied to the extraction of typical patterns from chemical compound data from which to generate classification rules, and that GBI also works as a feature construction component for other machine learning tools.作者: pulse-pressure 時間: 2025-3-31 23:03
https://doi.org/10.1007/978-3-319-03605-2rantee. In this paper, we allow an inference machine to infer a neighbor closure instead of the orig- inal language as an admissible approximation. We formalize such kind of inference, and give some sufficient conditions for a hypothesis space.作者: Consequence 時間: 2025-4-1 02:18
Discovery and Deduction one of learning from positive data, and the notion of ., which is commonly recognized in learning from positive data, is introduced into iterative computation of loop in- variants. The similarity between the widening operator in abstract inter- pretation and Gold’s notion of identification in the limit is also discussed.作者: V切開 時間: 2025-4-1 07:03 作者: 沙文主義 時間: 2025-4-1 12:29 作者: Incompetent 時間: 2025-4-1 17:06
Language Learning with a Neighbor Systemrantee. In this paper, we allow an inference machine to infer a neighbor closure instead of the orig- inal language as an admissible approximation. We formalize such kind of inference, and give some sufficient conditions for a hypothesis space.作者: 大量殺死 時間: 2025-4-1 21:52 作者: 沒有希望 時間: 2025-4-2 00:32
Prologue: The Medieval Atlantic Ocean of items. These notes were written for CS345 at Stanford University and are reprinted by permission of the author. http://www-db.stanford.edu/~ullman/mining/mining.html gives you access to the entire set of notes, including additional citations and on-line links.作者: FLAG 時間: 2025-4-2 06:11 作者: Pituitary-Gland 時間: 2025-4-2 09:31 作者: 精美食品 時間: 2025-4-2 11:40
Human Discovery Processes Based on Searching Experiments in Virtual Psychological Research Environmeulator in which subjects try to generate hypotheses and conduct experiments as scientists do. We analyze the subjects’ behavior based on SES and discuss the relation between the characteristics of their behavior and their performance of discovering targets.作者: 發(fā)生 時間: 2025-4-2 15:55
Probability Concepts in Quantum Mechanicsf this fraction as N goes to infinity. In many cases that arise in practice, the answers we get using this method can be shown to match heuristic assumptions made in many standard AI systems. I also show that when the language is restricted to unary predicates (for example, symptoms and diseases, bu作者: 群居動物 時間: 2025-4-2 20:33
Some Formal Models of Grading Principlesirrelevant pages, reducing the size of the link structure. Such functions are incorporated within our browser, allowing us to discover desired pages from a large web site incrementally. Relatively large web sites were selected to show the per- formance of the proposed method with improved accuracy a作者: 內(nèi)向者 時間: 2025-4-3 02:49
https://doi.org/10.1007/978-3-319-94869-0tation of the large database by means of a much smaller, fixed number of model sequences, and an easy interpretation of the clustering by means of visualization. The complete sequence database is mapped onto a two-dimensional graphic SOM display, and clusters of similar sequences are then found and 作者: Postmenopause 時間: 2025-4-3 05:11
Studies in the Sociology of Populationformer case, the algorithm is very simple and thus practical. This paper also shows that the algorithm can find an exact solution for simple functions if input data for each function are generated uniformly at random and the size of the domain is bounded by a constant. Results of preliminary computa
