<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>PyPI recent updates for StructuredGraphLearning</title>
    <link>https://pypi.org/project/structuredgraphlearning/</link>
    <description>Recent updates to the Python Package Index for StructuredGraphLearning</description>
    <language>en</language>    <item>
      <title>0.0.4</title>
      <link>https://pypi.org/project/structuredgraphlearning/0.0.4/</link>
      <description>spectralGraphTopology provides estimators to learn k-component, bipartite, and k-component bipartite graphs from data by imposing spectral constraints on the eigenvalues and eigenvectors of the Laplacian and adjacency matrices. Those estimators leverage spectral properties of the graphical models as a prior information which turn out to play key roles in unsupervised machine learning tasks such as clustering.</description>
<author>aditya510@gmail.com</author>      <pubDate>Mon, 12 Apr 2021 10:00:13 GMT</pubDate>
    </item>    <item>
      <title>0.0.3</title>
      <link>https://pypi.org/project/structuredgraphlearning/0.0.3/</link>
      <description>spectralGraphTopology provides estimators to learn k-component, bipartite, and k-component bipartite graphs from data by imposing spectral constraints on the eigenvalues and eigenvectors of the Laplacian and adjacency matrices. Those estimators leverage spectral properties of the graphical models as a prior information which turn out to play key roles in unsupervised machine learning tasks such as clustering.</description>
<author>aditya510@gmail.com</author>      <pubDate>Mon, 12 Apr 2021 09:52:01 GMT</pubDate>
    </item>    <item>
      <title>0.0.2</title>
      <link>https://pypi.org/project/structuredgraphlearning/0.0.2/</link>
      <description>spectralGraphTopology provides estimators to learn k-component, bipartite, and k-component bipartite graphs from data by imposing spectral constraints on the eigenvalues and eigenvectors of the Laplacian and adjacency matrices. Those estimators leverage spectral properties of the graphical models as a prior information which turn out to play key roles in unsupervised machine learning tasks such as clustering.</description>
<author>aditya510@gmail.com</author>      <pubDate>Mon, 12 Apr 2021 09:35:25 GMT</pubDate>
    </item>    <item>
      <title>0.0.1</title>
      <link>https://pypi.org/project/structuredgraphlearning/0.0.1/</link>
      <description>spectralGraphTopology provides estimators to learn k-component, bipartite, and k-component bipartite graphs from data by imposing spectral constraints on the eigenvalues and eigenvectors of the Laplacian and adjacency matrices. Those estimators leverage spectral properties of the graphical models as a prior information which turn out to play key roles in unsupervised machine learning tasks such as clustering.</description>
<author>aditya510@gmail.com</author>      <pubDate>Sun, 11 Apr 2021 15:08:25 GMT</pubDate>
    </item>  </channel>
</rss>