Portal: Difference between revisions

From MaRDI portal
Portal
No edit summary
No edit summary
(13 intermediate revisions by the same user not shown)
Line 37: Line 37:
     <div class="info-header"><span class="info-icon"><i class="fa fa-3x fa-info-circle" aria-hidden="true"></i></span><span class="info-title">About Us</span></div>
     <div class="info-header"><span class="info-icon"><i class="fa fa-3x fa-info-circle" aria-hidden="true"></i></span><span class="info-title">About Us</span></div>
     <div class="mw-collapsible-content">
     <div class="mw-collapsible-content">
    <h2>Welcome to the [https://www.mardi4nfdi.de MaRDI] Portal of the [https://nfdi.de NFDI].</h2>
        <h2>Welcome to the [https://www.mardi4nfdi.de MaRDI] Portal of the [https://nfdi.de NFDI].</h2>
    <p>
        <p>
    Here, you can query our mathematical research data knowledge graph. Please keep in mind that this page is still in an early stage of development. Currently, supported data sources: [https://dlmf.nist.gov/ DLMF], [https://cran.r-project.org/ CRAN], [[PolyDB | PolyDB]], [https://swmath.org swMATH] (partially), [https://zbmath.org/ zbMATH] (partially). <br/>
        Welcome to the MaRDI Portal — your gateway to open mathematical research data. Access our comprehensive MaRDI knowledge graph integrating data from sources like [https://dlmf.nist.gov/ DLMF], [https://cran.r-project.org/ CRAN], [[PolyDB | PolyDB]], [https://swmath.org swMATH] (partially), [https://zbmath.org/ zbMATH] (partially). Whether you are a researcher, a student, or simply someone passionate about mathematics, the MaRDI Portal is here to support your exploration, learning, and discovery with resources tailored to diverse needs and interests. <br/>
    <p>
        <p>
    We are supporting the open-source idea - you can find our [https://github.com/mardi4nfdi/ source code repositories here]. The technical [[Project:Documentation Overview|documentation can be found here]]. Or, maybe you want to read about [[Project:Personas|our personas]] - some  fictional characters that embody the distinct goals, motivations, and challenges of our users.
        We embrace the open-source philosophy — our [https://github.com/mardi4nfdi/ source code repositories] and [[Project:Documentation Overview|detailed technical documentation]] are freely accessible. Or, maybe you want to read about [[Project:Personas|our personas]] - some  fictional characters that embody the distinct goals, motivations, and challenges of our users. If you have further questions or recommendations, you can find ways to [https://www.mardi4nfdi.de/contact contact us here].
    If you have further questions or recommendations, you can find ways to [https://www.mardi4nfdi.de/contact contact us here].
        </p>
    </p>
     </div>
     </div>
</div>
</div>




Line 86: Line 81:
** [https://portal.mardi4nfdi.de/wiki/Publication:57414 Publication]
** [https://portal.mardi4nfdi.de/wiki/Publication:57414 Publication]
** [https://portal.mardi4nfdi.de/wiki/Software:13572 Software]
** [https://portal.mardi4nfdi.de/wiki/Software:13572 Software]
** [https://portal.mardi4nfdi.de/wiki/Dataset:4834875 Dataset]
** [https://portal.mardi4nfdi.de/wiki/Dataset:4834873 Dataset]
* Communities
* Communities
** [https://portal.mardi4nfdi.de/wiki/Community:6038427 Math+]
** [https://portal.mardi4nfdi.de/wiki/Community:6038427 Math+]
Line 103: Line 98:
</div>
</div>


<br /><br />
<div class="info-box mw-collapsible mw-collapsed">
    <div class="info-header"><span class="info-icon"><i class="fa fa-3x fa-share-square" aria-hidden="true"></i></span><span class="info-title">Paper of the day</span></div>
    <div class="mw-collapsible-content">
      <p>{{PaperOfTheDay|Q57414}}</p>
    </div>
</div>
<br /><br />




Line 166: Line 171:
<i class="fa fa-3x fa-database" aria-hidden="true"></i>
<i class="fa fa-3x fa-database" aria-hidden="true"></i>
       <div class="stats-number">
       <div class="stats-number">
     {| {{StatisticsRow|  | ?item wdt:P1473 ?openmlID }}  
     {| {{StatisticsRow|  | ?item wdt:P31 wd:Q56885 }}  
     |}
     |}
       </div>
       </div>
Line 172: Line 177:
     <div class="stats-label">OpenML Datasets</div>
     <div class="stats-label">OpenML Datasets</div>
   </div>
   </div>
 
  <div class="stat-box">
    <div class="stats-icon-number">
<i class="fa fa-3x fa-cogs" aria-hidden="true"></i>
      <div class="stats-number">
    {| {{StatisticsRow|  | ?item wdt:P1460 wd:Q6503324 }}
    |}
      </div>
    </div>
    <div class="stats-label">Services</div>
  </div> 
 
</div>
</div>


Line 207: Line 224:
-->
-->


<br /><br />
<div class="info-box mw-collapsible mw-collapsed">
    <div class="info-header">
        <span class="info-icon"><i class="fa fa-3x fa-share-square" aria-hidden="true"></i></span>
        <span class="info-title">Paper of the day</span>
    </div>
    <div class="mw-collapsible-content">
      <p>{{PaperOfTheDay|Q57414}}</p>
    </div>
</div>


</div>
</div>
__NOTOC__
__NOTOC__
__NOEDITSECTION__
__NOEDITSECTION__

Revision as of 00:22, 23 November 2024

About Us

Welcome to the MaRDI Portal of the NFDI.

Welcome to the MaRDI Portal — your gateway to open mathematical research data. Access our comprehensive MaRDI knowledge graph integrating data from sources like DLMF, CRAN, PolyDB, swMATH (partially), zbMATH (partially). Whether you are a researcher, a student, or simply someone passionate about mathematics, the MaRDI Portal is here to support your exploration, learning, and discovery with resources tailored to diverse needs and interests.

We embrace the open-source philosophy — our source code repositories and detailed technical documentation are freely accessible. Or, maybe you want to read about our personas - some fictional characters that embody the distinct goals, motivations, and challenges of our users. If you have further questions or recommendations, you can find ways to contact us here.


MaRDI Task Areas

The MaRDI project is organized into the following task areas:





Paper of the day

Discover today's highlight:

Model-based clustering of multiple networks with a hierarchical algorithm

Summary:
This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number of clusters. A novel technique is presented to address label-switching issues in SBMs by comparing graphons, enabling accurate aggregation of clusters. The method is evaluated on synthetic data and applied to ecological food web networks, demonstrating its efficiency, interpretability, and robustness compared to existing graph clustering approaches.

Easy summary:
This paper explains a way to group networks, like maps of connections between people or animals, based on how their structure is similar. It uses a smart math-based method called stochastic block models (SBMs) to figure out these groups automatically. The process builds a tree-like diagram (dendrogram) to show how the networks are connected and picks the best number of groups without guessing. A special trick compares parts of the networks to make sure the grouping is accurate, even if the networks are labeled differently. This method was tested on fake data and real examples, like food chains in nature, and worked better than older techniques.

Read more about it on the MaRDI portal: https://portal.mardi4nfdi.de/wiki/Publication:57414

Read more about it on arXiv: https://doi.org/10.48550/arXiv.2211.02314

(Hint: The summaries are AI generated and might contain errors.)




Triples
Humans
swMATH Items
zbMath Open Articles
arXiv Preprints
OpenML Datasets
Services



More Statistics

Triples

633667775

zbMATH Open articles

4856261

humans

1267690

zbMATH Open authors

1201477

arXiv

757127

Wikidata items

499864

swMATH

44542

CRAN packages

21260

DLMF

12564

Datasets

5496

PolyDB collections

21