Discovery Science: 6th International Conference, DS 2003, Sapporo, Japan, October 17-19,2003, Proceedings: Lecture Notes in Computer Science, cartea 2843
Editat de Gunter Grieser, Yuzuru Tanaka, Akihiro Yamamotoen Limba Engleză Paperback – 7 oct 2003
The 18 revised full papers and 29 revised short papers presented together with 3 invited papers and abstracts of 2 invited talks were carefully reviewed and selected from 80 submissions. The papers address all current issues in discovery science including substructure discovery, Web navigation patterns discovery, graph-based induction, time series data analysis, rough sets, genetic algorithms, clustering, genome analysis, chaining patterns, association rule mining, classification, content based filtering, bioinformatics, case-based reasoning, text mining, Web data analysis, and more.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 393.19 lei
Nou
Puncte Express: 590
Preț estimativ în valută:
75.25€ • 78.16$ • 62.50£
75.25€ • 78.16$ • 62.50£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540202936
ISBN-10: 3540202935
Pagini: 524
Ilustrații: XII, 504 p.
Dimensiuni: 155 x 233 x 28 mm
Greutate: 0.69 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540202935
Pagini: 524
Ilustrații: XII, 504 p.
Dimensiuni: 155 x 233 x 28 mm
Greutate: 0.69 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Abduction and the Dualization Problem.- Signal Extraction and Knowledge Discovery Based on Statistical Modeling.- Association Computation for Information Access.- Efficient Data Representations That Preserve Information.- Can Learning in the Limit Be Done Efficiently?.- Long Papers.- Discovering Frequent Substructures in Large Unordered Trees.- Discovering Rich Navigation Patterns on a Web Site.- Mining Frequent Itemsets with Category-Based Constraints.- Modelling Soil Radon Concentration for Earthquake Prediction.- Dialectical Evidence Assembly for Discovery.- Performance Analysis of a Greedy Algorithm for Inferring Boolean Functions.- Performance Evaluation of Decision Tree Graph-Based Induction.- Discovering Ecosystem Models from Time-Series Data.- An Optimal Strategy for Extracting Probabilistic Rules by Combining Rough Sets and Genetic Algorithm.- Extraction of Coverings as Monotone DNF Formulas.- What Kinds and Amounts of Causal Knowledge Can Be Acquired from Textby Using Connective Markers as Clues?.- Clustering Orders.- Business Application for Sales Transaction Data by Using Genome Analysis Technology.- Improving Efficiency of Frequent Query Discovery by Eliminating Non-relevant Candidates.- Chaining Patterns.- An Algorithm for Discovery of New Families of Optimal Regular Networks.- Enumerating Maximal Frequent Sets Using Irredundant Dualization.- Discovering Exceptional Information from Customer Inquiry by Association Rule Miner.- Short Papers.- Automatic Classification for the Identification of Relationships in a Meta-Data Repository.- Effects of Unreliable Group Profiling by Means of Data Mining.- Using Constraints in Discovering Dynamics.- SA-Optimized Multiple View Smooth Polyhedron Representation NN.- Elements of an Agile Discovery Environment.- Discovery of User Preference in Personalized Design Recommender System through Combining Collaborative Filtering and Content Based Filtering.- Discovery of Relationships between Interests fromBulletin Board System by Dissimilarity Reconstruction.- A Genetic Algorithm for Inferring Pseudoknotted RNA Structures from Sequence Data.- Prediction of Molecular Bioactivity for Drug Design Using a Decision Tree Algorithm.- Mining RNA Structure Elements from the Structure Data of Protein-RNA Complexes.- Discovery of Cellular Automata Rules Using Cases.- Discovery of Web Communities from Positive and Negative Examples.- Association Rules and Dempster-Shafer Theory of Evidence.- Subgroup Discovery among Personal Homepages.- Collaborative Filtering Using Projective Restoration Operators.- Discovering Homographs Using N-Partite Graph Clustering.- Discovery of Trends and States in Irregular Medical Temporal Data.- Creating Abstract Concepts for Classification by Finding Top-N Maximal Weighted Cliques.- Content-Based Scene Change Detection of Video Sequence Using Hierarchical Hidden Markov Model.- An Appraisal of UNIVAUTO – The First Discovery Program to Generate a Scientific Article.- Scilog: A Language for Scientific Processes and Scales.- Mining Multiple Clustering Data for Knowledge Discovery.- Bacterium Lingualis – The Web-Based Commonsensical Knowledge Discovery Method.- Inducing Biological Models from Temporal Gene Expression Data.- Knowledge Discovery on Chemical Reactivity from Experimental Reaction Information.- A Method of Extracting Related Words Using Standardized Mutual Information.- Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.- Mining Interesting Patterns Using Estimated Frequencies from Subpatterns and Superpatterns.
Caracteristici
Includes supplementary material: sn.pub/extras