{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":36,"n_cols":5,"rows_kept":36,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[14,4,14,5],[15,2,15,3],[16,2,16,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[29,2,29,3],[30,2,30,3],[33,2,33,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990008857770403321"]
[null,null,"Autore",null,"Cicero, Marcus Tullius <106 a.C.-43 a.C.>"]
[null,null,"Titolo",null,"Orationum deperditarum fragmenta / M. Tulli Ciceronis ; Iulius Puccioni recognovit"]
[null,null,"Pubbl/distr/stampa",null,"<Milano> : Mondadori, 1963"]
[null,null,"Descrizione fisica",null,"189 ; 18 cm"]
[null,null,"Collana",null,"Opera Omnia quae exstant critico apparatu instructa / consilio et auctoritate Collegi Ciceronianis Studiis Provehendis"]
[null,null,"Disciplina",null,"875.01"]
[null,null,"Locazione",null,"FLFBC"]
[null,null,"Collocazione",null,"P2B-650-CIC.M.T.-462A-1963"]
[null,null,"Lingua di pubblicazione",null,"Latino"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA996547969403316"]
[null,null,"Autore",null,"Dai Qionghai"]
[null,null,"Titolo",null,"Hypergraph Computation [[electronic resource] /] / by Qionghai Dai, Yue Gao"]
[null,null,"Pubbl/distr/stampa",null,"Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023"]
[null,null,"ISBN",null,"9789819901845"]
[{"$nulls":4},"9789819901852"]
[{"$nulls":4},"981-9901-85-5"]
[null,null,"Edizione",null,"[1st ed. 2023.]"]
[null,null,"Descrizione fisica",null,"1 online resource (xv, 244 pages) : illustrations"]
[null,null,"Collana",null,"Artificial Intelligence: Foundations, Theory, and Algorithms, , 2365-306X"]
[null,null,"Disciplina",null,"006.3"]
[null,null,"Soggetti",null,"Artificial intelligence"]
[{"$nulls":4},"Machine learning"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Artificial Intelligence"]
[{"$nulls":4},"Machine Learning"]
[{"$nulls":4},"Data Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical refences"]
[null,null,"Nota di contenuto",null,"Chapter 1. Introduction -- Chapter 2. Mathematical Foundations of Hypergraph -- Chapter 3. Hypergraph Computation Paradigms -- 4. Hypergraph Modeling -- Chapter 5. Typical Hypergraph Computation Tasks -- 6. Hypergraph Structure Evolution -- Chapter 7. Neural Networks on Hypergraph -- Chapter 8. Large Scale Hypergraph Computation -- Chapter 9. Hypergraph Computation for Social Media Analysis -- Chapter 10. Hypergraph Computation for Medical and Biological Applications -- Chapter 11. Hypergraph Computation for Computer Vision -- Chapter 12.The Deep Hypergraph Library -- Chapter 13. Conclusions and Future Work."]
[null,null,null,"Sommario/riassunto","This open access book discusses the theory and methods of hypergraph computation. Many underlying relationships among data can be represented using graphs, for example in the areas including computer vision, molecular chemistry, molecular biology, etc. In the last decade, methods like graph-based learning and neural network methods have been developed to process such data, they are particularly suitable for handling relational learning tasks. In many real-world problems, however, relationships among the objects of our "]
[{"$nulls":4},"interest are more complex than pair-wise. Naively squeezing the complex relationships into pairwise ones will inevitably lead to loss of information which can be expected valuable for learning tasks. Hypergraph, as a generation of graph, has shown superior performance on modelling complex correlations compared with graph. Recent years have witnessed a great popularity of researches on hypergraph-related AI methods, which have been used in computer vision, social media analysis, etc. We summarize these attempts as a new computing paradigm, called hypergraph computation, which is to formulate the high-order correlations underneath the data using hypergraph, and then conduct semantic computing on the hypergraph for different applications. The content of this book consists of hypergraph computation paradigms, hypergraph modelling, hypergraph structure evolution, hypergraph neural networks, and applications of hypergraph computation in different fields. We further summarize recent achievements and future directions on hypergraph computation in this book."]