Bisociative Knowledge Discovery : (Kayıt no. 15726)
[ düz görünüm ]
| 000 -BAŞLIK | |
|---|---|
| Sabit Uzunluktaki Kontrol Alanı | 11339nam a22004813i 4500 |
| 001 - KONTROL NUMARASI | |
| Control Dosyası | EBC6422610 |
| 003 - KONTROL NUMARASI KİMLİĞİ | |
| Kontrol Alanı | MiAaPQ |
| 005 - EN SON İŞLEM TARİHİ ve ZAMANI | |
| Kontrol Alanı | 20220623112332.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS | |
| fixed length control field | m o d | |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cnu|||||||| |
| 008 - SABİT UZUNLUKTAKİ VERİ ÖGELERİ - GENEL BİLGİ | |
| Sabit Alan | 220617s2012 xx o ||||0 eng d |
| 020 ## - ISBN - ULUSLARARASI STANDART KİTAP NUMARASI | |
| Isbn | 9783642318306 |
| -- | (electronic bk.) |
| 020 ## - ISBN - ULUSLARARASI STANDART KİTAP NUMARASI | |
| Cancelled/invalid ISBN | 9783642318290 |
| 035 ## - SİSTEM KONTROL NUMARASI | |
| Sistem Kontrol Numarası | (MiAaPQ)EBC6422610 |
| 035 ## - SİSTEM KONTROL NUMARASI | |
| Sistem Kontrol Numarası | (Au-PeEL)EBL6422610 |
| 035 ## - SİSTEM KONTROL NUMARASI | |
| Sistem Kontrol Numarası | (OCoLC)798652496 |
| 040 ## - KATALOGLAMA KAYNAĞI | |
| Özgün Kataloglama Kurumu | MiAaPQ |
| Kataloglama Dili | eng |
| Açıklama Kuralları | rda |
| -- | pn |
| Çeviri Kurumu | MiAaPQ |
| Değiştiren Kurum | MiAaPQ |
| 050 #4 - SINIFLAMA ve YER NUMARASI | |
| Sınıflama Numarası | Q334-342 |
| 082 0# - DEWEY ONU SINIFLAMA SİSTEMİ | |
| Sınıflama Numarası | 006.3/12 |
| 100 1# - KİŞİ ADI | |
| Yazar Adı (Kişi adı) | Berthold, Michael R. |
| 245 10 - ESER ADI BİLDİRİMİ | |
| Başlık | Bisociative Knowledge Discovery : |
| Alt Eseradı vb. | An Introduction to Concept, Algorithms, Tools, and Applications. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | Berlin, Heidelberg : |
| Name of producer, publisher, distributor, manufacturer | Springer Berlin / Heidelberg, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2012. |
| 264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Date of production, publication, distribution, manufacture, or copyright notice | �2012. |
| 300 ## - FİZİKSEL TANIMLAMA | |
| Sayfa, Cilt vb. | 1 online resource (491 pages) |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 490 1# - DİZİ BİLDİRİMİ | |
| Dizi Bildirimi | Lecture Notes in Computer Science Ser. ; |
| Cilt Numarası | v.7250 |
| 505 0# - İÇİNDEKİLER NOTU | |
| İçindekiler Notu | Title -- Foreword -- Table of Contents -- Part I: Bisociation -- Towards Bisociative Knowledge Discovery -- Motivation -- Bisociation -- Types of Bisociation -- Bridging Concepts -- Bridging Graphs -- Bridging by Structural Similarity -- Other Types of Bisociation -- Bisociation Discovery Methods -- Future Directions -- Conclusions -- References -- Towards Creative Information Exploration Based on Koestler's Concept of Bisociation -- Introduction -- Creativity -- What Is Creativity? -- Three Roads to Creativity -- Computational Creativity -- Koestler's Concept of Bisociation -- Elements of Bisociative Computational Creativity -- Towards a Formal Definition of Bisociation -- Related Work -- Discussion and Conclusion -- References -- From Information Networks to Bisociative Information Networks -- Introduction -- Different Categories of Information Network -- Properties of Information Units -- Properties of Relations -- Prominent Types of Information Networks -- Ontologies -- Semantic Networks -- Topic Maps -- Weighted Networks -- BisoNets: Bisociative Information Networks -- Summary -- Patterns of Bisociation in BisoNets -- Bridging Concept -- Bridging Graphs -- Bridging by Graph Similarity -- Conclusion -- References -- Part II: Representation and Network Creation -- Network Creation: Overview -- References -- Selecting the Links in BisoNets Generated from Document Collections -- Introduction -- Reminder: Bisociation and BisoNets -- BisoNet Generation -- Data Access and Pre-processing -- Creating Nodes -- Linking Nodes: Different Metrics -- Cosine and Tanimoto Measures -- The Bison Measure -- The Probabilistic Measure -- Benchmarks -- The Swanson Benchmark -- The Biology and Music Benchmark -- Conclusion -- References -- Bridging Concept Identification for Constructing Information Networks from Text Documents -- Introduction. |
| 505 8# - İÇİNDEKİLER NOTU | |
| İçindekiler Notu | Problem Description -- Document Acquisition and Preprocessing -- Document Acquisition -- Document Preprocessing -- Background Knowledge -- Candidate Concept Detection -- Distance Measures between Vectors -- Identifying Bridging Concept Candidates for High Quality Network Entities Extraction -- Heuristics Description -- Frequency Based Heuristics -- Tf-idf Based Heuristics -- Similarity Based Heuristics -- Outlier Based Heuristics -- Baseline Heuristics -- Heuristics Evaluation -- Evaluation Procedure -- Migraine-Magnesium Dataset -- Comparison of the Heuristics -- Network Creation -- References -- Discovery of Novel Term Associations in a Document Collection -- Introduction -- Related Work -- The tpf-idf-tpu Model of Important Term Pair Associations -- Term Pair Frequency (tpf) and Inverse Document Frequency (idf) -- Term Pair Uncorrelation (tpu) -- Experiments -- Tpf-idf-tpu vs. tf-idf -- Sentence vs. Document-Level tpf-idf-tpu Methods -- Comparison of tpf-idf-tpu and tf-idf Using Annotated Test Set -- Conclusion -- References -- Cover Similarity Based Item Set Mining -- Introduction -- Frequent Item Set Mining -- Jaccard Item Sets -- The Eclat Algorithm -- The JIM Algorithm (Jaccard Item Set Mining) -- Other Similarity Measures -- Experiments -- Conclusions -- References -- Patterns and Logic for Reasoning with Networks -- Introduction -- The Biomine and ProbLog Frameworks -- Using Graphs: Biomine -- Using Logic: ProbLog -- Summary -- Inference and Reasoning Techniques -- Deduction: Reasoning about Node Tuples -- Abduction: Reasoning about Subgraphs -- Induction: Finding Patterns -- Combining Induction and Deduction -- Modifying the Knowledge Base -- Summary -- Using Probabilistic or Algebraic Labels -- The Probabilistic Model of Biomine and ProbLog -- Probabilistic Deduction -- Probabilistic Abduction and Top-k Instantiations. |
| 505 8# - İÇİNDEKİLER NOTU | |
| İçindekiler Notu | Patterns and Probabilities -- Combining Induction and Deduction -- Modifying the Probabilistic Knowledge Base -- Beyond Probabilities -- Conclusions -- References -- Part III: Network Analysis -- Network Analysis: Overview -- References -- BiQL: A Query Language for Analyzing Information Networks -- Introduction -- Motivating Example -- Requirements -- Data Representation -- Basic Data Manipulation -- Illustrative Examples -- Related Work -- Knowledge Discovery -- Databases -- Conclusions -- References -- Review of BisoNet Abstraction Techniques -- Introduction -- Preference-Free Methods -- Relative Neighborhood Graph -- Node Centrality -- PageRank and HITS -- Birnbaum's Component Importance -- Graph Partitioning -- Hierarchical Clustering -- Edge Betweenness -- Frequent Subgraphs -- Preference-Dependent Methods -- Relevant Subgraph Extraction -- Detecting Interesting Nodes or Paths -- Personalized PageRank -- Exact Subgraph Search -- Similarity Subgraph Search -- Conclusion -- References -- Simplification of Networks by Edge Pruning -- Introduction -- Lossy Network Simplification -- Definitions -- Example Instances of the Framework -- Analysis of the Problem -- Multiplicativity of Ratio of Connectivity Kept -- A Bound on the Ratio of Connectivity Kept -- A Further Bound on the Ratio of Connectivity Kept -- Algorithms -- Naive Approach -- Brute Force Approach -- Path Simplification -- Combinational Approach -- Experiments -- Experimental Setup -- Results -- Related Work -- Conclusion -- References -- Network Compression by Node and Edge Mergers -- Introduction -- Problem Definition -- Weighted and Compressed Graphs -- Simple Weighted Graph Compression -- Generalized Weighted Graph Compression -- Optimal Superedge Weights and Mergers -- Bounds for Distances between Graphs -- A Bound on Distances between Nodes -- Related Work -- Algorithms. |
| 505 8# - İÇİNDEKİLER NOTU | |
| İçindekiler Notu | Experiments -- Experimental Setup -- Results -- Conclusions -- References -- Finding Representative Nodes in Probabilistic Graphs -- Introduction -- Related Work -- Similarities in Probabilistic Graphs -- Clustering and Representatives in Graphs -- Experiments -- Test Setting -- Results -- Conclusions -- References -- (Missing) Concept Discovery in Heterogeneous Information Networks -- Introduction -- Bisociative Information Networks -- Concept Graphs -- Preliminaries -- Detection -- Application -- Results -- Conclusion and Future work -- References -- Node Similarities from Spreading Activation -- Introduction -- Related Work -- Spreading Activation -- Linear Standard Scenario -- Node Signatures -- Node Similarities -- Activation Similarity -- Signature Similarity -- Experiments -- Schools-Wikipedia -- Conclusion -- References -- Towards Discovery of Subgraph Bisociations -- Motivation -- Networks, Domains and Bisociations -- Knowledge Modeling -- Domains -- Bisociations -- Finding and Assessing Bisociations -- Domain Extraction -- Scoring Bisociation Candidates -- Complexity and Scalability -- Preliminary Evaluation -- Related Work -- Conclusion -- References -- Part IV: Exploration -- Exploration: Overview -- Introduction -- Contributions -- Conclusions -- References -- Data Exploration for Bisociative Knowledge Discovery: A Brief Overview of Tools and Evaluation Methods -- Introduction -- Bisociative Data Exploration -- Different Meanings of Exploration -- Definition of Bisociative Exploration -- Implications for User Interface Design -- Supporting Bisociative Data Exploration -- Tools for Data Exploration -- Evaluation of Knowledge Discovery Tools -- Evaluation Challenges -- Open Issues -- Benchmark Evaluation for Discovery Tools -- Conclusion and Future Work -- References. |
| 505 8# - İÇİNDEKİLER NOTU | |
| İçindekiler Notu | On the Integration of Graph Exploration and Data Analysis: The Creative Exploration Toolkit -- Introduction -- State of the Art in Graph Interaction and Visualization -- The Creative Exploration Toolkit -- Network and Algorithm Providers -- Communication between CET and Other Tools -- The KNIME Information Mining Platform -- Wikipedia -- Evaluation -- Study Design -- Results of the Study -- Conclusion and Future Work -- References -- Bisociative Knowledge Discovery by Literature Outlier Detection -- Introduction -- Related Work in Literature Mining -- The Upgraded RaJoLink Knowledge Discovery Process -- Outlier Detection in the RaJoLink Knowledge Discovery Process -- Application of Outlier Detection in the Autism Literature -- Conclusions -- References -- Exploring the Power of Outliers for Cross-Domain Literature Mining -- Introduction -- Related Work -- Experimental Datasets -- Detecting Outlier Documents -- Classification Noise Filters for Outlier Detection -- Experimental Evaluation -- Conclusions -- References -- Bisociative Literature Mining by Ensemble Heuristics -- Introduction -- Problem Description -- Methodology for Bridging Concept Identification and Ranking -- Base Heuristics -- Ensemble Heuristic -- Evaluation of the Methodology -- Experimental Setting -- Results in the Migraine-Magnesium Dataset -- Results in Autism-Calcineurin Dataset -- The CrossBee System -- A Typical Use Case -- Other CrossBee Functionalities -- Discussion and Further Work -- References -- Part V: Applications and Evaluation -- Applications and Evaluation: Overview -- Introduction -- Contributions -- Lessons Learned -- The BISON Software for Applications Development -- Application Potential of the BISON Methodology -- Evaluation of the BISON Methodology and the Potential for Triggering Creativity. |
| 505 8# - İÇİNDEKİLER NOTU | |
| İçindekiler Notu | The Future of Bisociative Reasoning and Cross-Context Data Mining. |
| 520 ## - ÖZET NOTU | |
| Özet notu | The focus of this book, and the BISON project from which the contributions originate, is a network based integration of data repositories of a variety of types, and the development of new ways to analyse and explore the resulting gigantic information networks. |
| 590 ## - LOCAL NOTE (RLIN) | |
| Local note | Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2022. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| Main entry heading | Berthold, Michael R. |
| Title | Bisociative Knowledge Discovery |
| Place, publisher, and date of publication | Berlin, Heidelberg : Springer Berlin / Heidelberg,c2012 |
| International Standard Book Number | 9783642318290 |
| 797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN) | |
| Corporate name or jurisdiction name as entry element | ProQuest (Firm) |
| 856 40 - ELEKTRONİK YER ve ERİŞİM | |
| Kaynak Tanımlayıcı (URL) | <a href="https://ebookcentral.proquest.com/lib/ostimteknik/detail.action?docID=6422610">https://ebookcentral.proquest.com/lib/ostimteknik/detail.action?docID=6422610</a> |
| Public note | Click to View |
| 588 ## - SOURCE OF DESCRIPTION NOTE | |
| Ekli Tam Metin | Description based on publisher supplied metadata and other sources. |
Kullanılabilir materyal yok.
