ANALYSIS OF CLUSTERED DATA
A method may include obtaining a set of tags and a set of items in which each item is pre-sorted into a cluster and each item corresponds to one or more tags. The method may include generating a bipartite graph that includes the set of tags as a first set of nodes and the clusters of items as a seco...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | MANDAL, Avradip USHIJIMA-MWESIGWA, Hayato GHOSH, Indradeep LIU, Xiaoyuan |
| description | A method may include obtaining a set of tags and a set of items in which each item is pre-sorted into a cluster and each item corresponds to one or more tags. The method may include generating a bipartite graph that includes the set of tags as a first set of nodes and the clusters of items as a second set of nodes. Relationships between tags and items may be represented as edges between the first nodes and the second nodes. The bipartite graph may be modeled as a quadratic programming formulation, and cluster descriptor sets that each include one or more of the tags may be determined by solving the quadratic programming formulation of the bipartite graph, each of the cluster descriptor sets providing an explanation of how one or more clusters of items were pre-sorted. The method may include analyzing the items based on the luster descriptor sets. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2023376569A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2023376569A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2023376569A13</originalsourceid><addsrcrecordid>eNrjZJBy9HP0iQz2DFbwd1Nw9gkNDnENcnVRcHEMceRhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGRsbG5mamZpaOhsbEqQIAqy0hKQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>ANALYSIS OF CLUSTERED DATA</title><source>esp@cenet</source><creator>MANDAL, Avradip ; USHIJIMA-MWESIGWA, Hayato ; GHOSH, Indradeep ; LIU, Xiaoyuan</creator><creatorcontrib>MANDAL, Avradip ; USHIJIMA-MWESIGWA, Hayato ; GHOSH, Indradeep ; LIU, Xiaoyuan</creatorcontrib><description>A method may include obtaining a set of tags and a set of items in which each item is pre-sorted into a cluster and each item corresponds to one or more tags. The method may include generating a bipartite graph that includes the set of tags as a first set of nodes and the clusters of items as a second set of nodes. Relationships between tags and items may be represented as edges between the first nodes and the second nodes. The bipartite graph may be modeled as a quadratic programming formulation, and cluster descriptor sets that each include one or more of the tags may be determined by solving the quadratic programming formulation of the bipartite graph, each of the cluster descriptor sets providing an explanation of how one or more clusters of items were pre-sorted. The method may include analyzing the items based on the luster descriptor sets.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231123&DB=EPODOC&CC=US&NR=2023376569A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76419</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231123&DB=EPODOC&CC=US&NR=2023376569A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>MANDAL, Avradip</creatorcontrib><creatorcontrib>USHIJIMA-MWESIGWA, Hayato</creatorcontrib><creatorcontrib>GHOSH, Indradeep</creatorcontrib><creatorcontrib>LIU, Xiaoyuan</creatorcontrib><title>ANALYSIS OF CLUSTERED DATA</title><description>A method may include obtaining a set of tags and a set of items in which each item is pre-sorted into a cluster and each item corresponds to one or more tags. The method may include generating a bipartite graph that includes the set of tags as a first set of nodes and the clusters of items as a second set of nodes. Relationships between tags and items may be represented as edges between the first nodes and the second nodes. The bipartite graph may be modeled as a quadratic programming formulation, and cluster descriptor sets that each include one or more of the tags may be determined by solving the quadratic programming formulation of the bipartite graph, each of the cluster descriptor sets providing an explanation of how one or more clusters of items were pre-sorted. The method may include analyzing the items based on the luster descriptor sets.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZJBy9HP0iQz2DFbwd1Nw9gkNDnENcnVRcHEMceRhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGRsbG5mamZpaOhsbEqQIAqy0hKQ</recordid><startdate>20231123</startdate><enddate>20231123</enddate><creator>MANDAL, Avradip</creator><creator>USHIJIMA-MWESIGWA, Hayato</creator><creator>GHOSH, Indradeep</creator><creator>LIU, Xiaoyuan</creator><scope>EVB</scope></search><sort><creationdate>20231123</creationdate><title>ANALYSIS OF CLUSTERED DATA</title><author>MANDAL, Avradip ; USHIJIMA-MWESIGWA, Hayato ; GHOSH, Indradeep ; LIU, Xiaoyuan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2023376569A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>MANDAL, Avradip</creatorcontrib><creatorcontrib>USHIJIMA-MWESIGWA, Hayato</creatorcontrib><creatorcontrib>GHOSH, Indradeep</creatorcontrib><creatorcontrib>LIU, Xiaoyuan</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>MANDAL, Avradip</au><au>USHIJIMA-MWESIGWA, Hayato</au><au>GHOSH, Indradeep</au><au>LIU, Xiaoyuan</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>ANALYSIS OF CLUSTERED DATA</title><date>2023-11-23</date><risdate>2023</risdate><abstract>A method may include obtaining a set of tags and a set of items in which each item is pre-sorted into a cluster and each item corresponds to one or more tags. The method may include generating a bipartite graph that includes the set of tags as a first set of nodes and the clusters of items as a second set of nodes. Relationships between tags and items may be represented as edges between the first nodes and the second nodes. The bipartite graph may be modeled as a quadratic programming formulation, and cluster descriptor sets that each include one or more of the tags may be determined by solving the quadratic programming formulation of the bipartite graph, each of the cluster descriptor sets providing an explanation of how one or more clusters of items were pre-sorted. The method may include analyzing the items based on the luster descriptor sets.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2023376569A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | ANALYSIS OF CLUSTERED DATA |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T05%3A42%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=MANDAL,%20Avradip&rft.date=2023-11-23&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2023376569A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |