<?xml version="1.0" encoding="UTF-8" ?>
<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xmlns:slims="http://slims.web.id" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3" id="23802">
 <titleInfo>
  <title>Hypergraph Computation</title>
 </titleInfo>
 <name type="Personal Name" authority="">
  <namePart>Qionghai Dai</namePart>
  <role>
   <roleTerm type="text">Primary Author</roleTerm>
  </role>
 </name>
 <name type="Personal Name" authority="">
  <namePart>Yue Gao</namePart>
  <role>
   <roleTerm type="text">Primary Author</roleTerm>
  </role>
 </name>
 <typeOfResource manuscript="no" collection="yes">mixed material</typeOfResource>
 <genre authority="marcgt">bibliography</genre>
 <originInfo>
  <place>
   <placeTerm type="text">Springer Nature Singapore</placeTerm>
   <publisher>Springer Nature</publisher>
   <dateIssued>2023</dateIssued>
  </place>
 </originInfo>
 <language>
  <languageTerm type="code">en</languageTerm>
  <languageTerm type="text">English</languageTerm>
 </language>
 <physicalDescription>
  <form authority="gmd">Ebook</form>
  <extent>244 Halaman</extent>
 </physicalDescription>
 <note>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 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.</note>
 <note type="statement of responsibility"></note>
 <subject authority="">
  <topic>Algoritma</topic>
 </subject>
 <subject authority="">
  <topic>Pembelajaran Mesin</topic>
 </subject>
 <subject authority="">
  <topic>Kecerdasan Buatan</topic>
 </subject>
 <classification>006.31</classification>
 <identifier type="isbn">9789819901845</identifier>
 <location>
  <physicalLocation>Perpustakaan UMA Online Public Access Catalog (OPAC)</physicalLocation>
  <shelfLocator>006.31 Qio h</shelfLocator>
  <holdingSimple>
   <copyInformation>
    <numerationAndChronology type="1">EB26000346</numerationAndChronology>
    <sublocation>Perpustakaan Pusat UMA</sublocation>
    <shelfLocator>006.31 Qio h</shelfLocator>
   </copyInformation>
  </holdingSimple>
 </location>
 <slims:digitals>
  <slims:digital_item id="2842" url="https://library.oapen.org/viewer/web/viewer.html?file=/bitstream/handle/20.500.12657/63610/978-981-99-0185-2.pdf?sequence=1&amp;isAllowed=y" path="/https://library.oapen.org/viewer/web/viewer.html?file=/bitstream/handle/20.500.12657/63610/978-981-99-0185-2.pdf?sequence=1&amp;isAllowed=y" mimetype="text/uri-list">Hypergraph Computation</slims:digital_item>
 </slims:digitals>
 <slims:image>978-981-99-0185-2.pdf.jpg.jpg</slims:image>
 <recordInfo>
  <recordIdentifier>23802</recordIdentifier>
  <recordCreationDate encoding="w3cdtf">2026-10-29 11:39:00</recordCreationDate>
  <recordChangeDate encoding="w3cdtf">2026-10-29 11:39:31</recordChangeDate>
  <recordOrigin>machine generated</recordOrigin>
 </recordInfo>
</mods>
</modsCollection>