|
|
|
|
LEADER |
04241nmm a2200421 u 4500 |
001 |
EB000652524 |
003 |
EBX01000000000000000505606 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
140122 ||| eng |
020 |
|
|
|a 9783540302148
|
100 |
1 |
|
|a Suzuki, Einoshin
|e [editor]
|
245 |
0 |
0 |
|a Discovery Science
|h Elektronische Ressource
|b 7th International Conference, DS 2004, Padova, Italy, October 2-5, 2004. Proceedings
|c edited by Einoshin Suzuki, Setsuo Arikawa
|
250 |
|
|
|a 1st ed. 2004
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2004, 2004
|
300 |
|
|
|a XII, 430 p
|b online resource
|
505 |
0 |
|
|a An Associative Information Retrieval Based on the Dependency of Term Co-occurrence -- On the Convergence of Incremental Knowledge Base Construction -- Privacy Problems with Anonymized Transaction Databases -- A Methodology for Biologically Relevant Pattern Discovery from Gene Expression Data -- Using the Computer to Study the Dynamics of the Handwriting Processes -- Product Recommendation in e-Commerce Using Direct and Indirect Confidence for Historical User Sessions -- Regular Papers -- Optimal Discovery of Subword Associations in Strings -- Tiling Databases -- A Clustering of Interestingness Measures -- Extracting Minimal and Closed Monotone DNF Formulas -- Characterizations of Multivalued Dependencies and Related Expressions -- Outlier Handling in the Neighbourhood-Based Learning of a Continuous Class -- A New Clustering Algorithm Based On Cluster Validity Indices -- An Efficient Rules Induction Algorithm for Rough Set Classification --
|
505 |
0 |
|
|a Long Papers -- Predictive Graph Mining -- An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases -- Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance -- Mining Noisy Data Streams via a Discriminative Model -- CorClass: Correlated Association Rule Mining for Classification -- Maximum a Posteriori Tree Augmented Naive Bayes Classifiers -- Improving Prediction of Distance-Based Outliers -- Detecting Outliers via Logical Theories and Its Data Complexity -- Fast Hierarchical Clustering Algorithm Using Locality-Sensitive Hashing -- Measuring the Similarity for Heterogenous Data: An Ordered Probability-Based Approach -- Constructive Inductive Learning Based on Meta-attributes -- Resemblance Coefficient and a Quantum Genetic Algorithm for Feature Selection -- Extracting Positive Attributions from Scientific Papers -- Enhancing SVM with Visualization --
|
505 |
0 |
|
|a Analysing the Trade-Off Between Comprehensibility and Accuracy in Mimetic Models -- Generating AVTs Using GA for Learning Decision Tree Classifiers with Missing Data -- Using WWW-Distribution of Words in Detecting Peculiar Web Pages -- DHT Facilitated Web Service Discovery Incorporating Semantic Annotation -- Discovering Relationships Among Catalogs -- Reasoning-Based Knowledge Extraction for Text Classification -- A Useful System Prototype for Intrusion Detection – Architecture and Experiments -- Discovery of Hidden Similarity on Collaborative Filtering to Overcome Sparsity Problem -- Seamlessly Supporting Combined Knowledge Discovery and Query Answering: A Case Study -- A Structuralist Approach Towards Computational Scientific Discovery -- Extracting Modal Implications and Equivalences from Cognitive Minds
|
653 |
|
|
|a Computer Application in Social and Behavioral Sciences
|
653 |
|
|
|a Information Storage and Retrieval
|
653 |
|
|
|a Artificial Intelligence
|
653 |
|
|
|a Social sciences / Data processing
|
653 |
|
|
|a Database Management
|
653 |
|
|
|a Information storage and retrieval systems
|
653 |
|
|
|a Computer Application in Administrative Data Processing
|
653 |
|
|
|a Artificial intelligence
|
653 |
|
|
|a Science / Philosophy
|
653 |
|
|
|a Information technology / Management
|
653 |
|
|
|a Database management
|
653 |
|
|
|a Philosophy of Science
|
700 |
1 |
|
|a Arikawa, Setsuo
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
028 |
5 |
0 |
|a 10.1007/b100845
|
856 |
4 |
0 |
|u https://doi.org/10.1007/b100845?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 501
|