Suffix Forest: A novel in-memory data structure for analyzing time-series data
The present invention generally relates to a method for introducing suffix forest for mining tri-clusters from time series data comprises scanning all rows one by one and creating suffixes by deleting one front item in each rotation and appended in the tree to build a suffix-tree from SFD; showing d...
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 | Chattopadhyay, Samiran Mondal, Kartick Chandra Sarkar, Sunita Ghosh, Moumita Mondal, Anindita Sarkar Mukhopadhyay, Somnath Fajriyah, Rohmatul |
| description | The present invention generally relates to a method for introducing suffix forest for mining tri-clusters from time series data comprises scanning all rows one by one and creating suffixes by deleting one front item in each rotation and appended in the tree to build a suffix-tree from SFD; showing data that satisfies each element in a particular branch by leaf node thereby gives clustered results; performing a cumulative addition of new suffixes over the suffix-tree built from the first SFD to merge multiple SFDs, wherein cumulative addition follows the match and buildEdge function to generate the Suffix-forest; and removing redundancy by pruning and merging the dataset of TM thereby extracting tri-clusters from leaf of the data structure. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_AU2021107061A4</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>AU2021107061A4</sourcerecordid><originalsourceid>FETCH-epo_espacenet_AU2021107061A43</originalsourceid><addsrcrecordid>eNqNyr0KwjAQAOAsDqK-w4FzIKmi4BbE4uSiziXUSwnkp-QuYn16QXwAp2_55uJyrc75F7S5IPEBDKT8xAA-yYgxlwkeli0Ql9pzLQguF7DJhunt0wDsI0rC4pG-cSlmzgbC1c-FWLen2_Esccwd0mh7TMiduTeq0Vrt1U6b7ea_9QG0ZTb3</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Suffix Forest: A novel in-memory data structure for analyzing time-series data</title><source>esp@cenet</source><creator>Chattopadhyay, Samiran ; Mondal, Kartick Chandra ; Sarkar, Sunita ; Ghosh, Moumita ; Mondal, Anindita Sarkar ; Mukhopadhyay, Somnath ; Fajriyah, Rohmatul</creator><creatorcontrib>Chattopadhyay, Samiran ; Mondal, Kartick Chandra ; Sarkar, Sunita ; Ghosh, Moumita ; Mondal, Anindita Sarkar ; Mukhopadhyay, Somnath ; Fajriyah, Rohmatul</creatorcontrib><description>The present invention generally relates to a method for introducing suffix forest for mining tri-clusters from time series data comprises scanning all rows one by one and creating suffixes by deleting one front item in each rotation and appended in the tree to build a suffix-tree from SFD; showing data that satisfies each element in a particular branch by leaf node thereby gives clustered results; performing a cumulative addition of new suffixes over the suffix-tree built from the first SFD to merge multiple SFDs, wherein cumulative addition follows the match and buildEdge function to generate the Suffix-forest; and removing redundancy by pruning and merging the dataset of TM thereby extracting tri-clusters from leaf of the data structure.</description><language>eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2021</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=20211202&DB=EPODOC&CC=AU&NR=2021107061A4$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20211202&DB=EPODOC&CC=AU&NR=2021107061A4$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Chattopadhyay, Samiran</creatorcontrib><creatorcontrib>Mondal, Kartick Chandra</creatorcontrib><creatorcontrib>Sarkar, Sunita</creatorcontrib><creatorcontrib>Ghosh, Moumita</creatorcontrib><creatorcontrib>Mondal, Anindita Sarkar</creatorcontrib><creatorcontrib>Mukhopadhyay, Somnath</creatorcontrib><creatorcontrib>Fajriyah, Rohmatul</creatorcontrib><title>Suffix Forest: A novel in-memory data structure for analyzing time-series data</title><description>The present invention generally relates to a method for introducing suffix forest for mining tri-clusters from time series data comprises scanning all rows one by one and creating suffixes by deleting one front item in each rotation and appended in the tree to build a suffix-tree from SFD; showing data that satisfies each element in a particular branch by leaf node thereby gives clustered results; performing a cumulative addition of new suffixes over the suffix-tree built from the first SFD to merge multiple SFDs, wherein cumulative addition follows the match and buildEdge function to generate the Suffix-forest; and removing redundancy by pruning and merging the dataset of TM thereby extracting tri-clusters from leaf of the data structure.</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyr0KwjAQAOAsDqK-w4FzIKmi4BbE4uSiziXUSwnkp-QuYn16QXwAp2_55uJyrc75F7S5IPEBDKT8xAA-yYgxlwkeli0Ql9pzLQguF7DJhunt0wDsI0rC4pG-cSlmzgbC1c-FWLen2_Esccwd0mh7TMiduTeq0Vrt1U6b7ea_9QG0ZTb3</recordid><startdate>20211202</startdate><enddate>20211202</enddate><creator>Chattopadhyay, Samiran</creator><creator>Mondal, Kartick Chandra</creator><creator>Sarkar, Sunita</creator><creator>Ghosh, Moumita</creator><creator>Mondal, Anindita Sarkar</creator><creator>Mukhopadhyay, Somnath</creator><creator>Fajriyah, Rohmatul</creator><scope>EVB</scope></search><sort><creationdate>20211202</creationdate><title>Suffix Forest: A novel in-memory data structure for analyzing time-series data</title><author>Chattopadhyay, Samiran ; Mondal, Kartick Chandra ; Sarkar, Sunita ; Ghosh, Moumita ; Mondal, Anindita Sarkar ; Mukhopadhyay, Somnath ; Fajriyah, Rohmatul</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_AU2021107061A43</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2021</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Chattopadhyay, Samiran</creatorcontrib><creatorcontrib>Mondal, Kartick Chandra</creatorcontrib><creatorcontrib>Sarkar, Sunita</creatorcontrib><creatorcontrib>Ghosh, Moumita</creatorcontrib><creatorcontrib>Mondal, Anindita Sarkar</creatorcontrib><creatorcontrib>Mukhopadhyay, Somnath</creatorcontrib><creatorcontrib>Fajriyah, Rohmatul</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chattopadhyay, Samiran</au><au>Mondal, Kartick Chandra</au><au>Sarkar, Sunita</au><au>Ghosh, Moumita</au><au>Mondal, Anindita Sarkar</au><au>Mukhopadhyay, Somnath</au><au>Fajriyah, Rohmatul</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Suffix Forest: A novel in-memory data structure for analyzing time-series data</title><date>2021-12-02</date><risdate>2021</risdate><abstract>The present invention generally relates to a method for introducing suffix forest for mining tri-clusters from time series data comprises scanning all rows one by one and creating suffixes by deleting one front item in each rotation and appended in the tree to build a suffix-tree from SFD; showing data that satisfies each element in a particular branch by leaf node thereby gives clustered results; performing a cumulative addition of new suffixes over the suffix-tree built from the first SFD to merge multiple SFDs, wherein cumulative addition follows the match and buildEdge function to generate the Suffix-forest; and removing redundancy by pruning and merging the dataset of TM thereby extracting tri-clusters from leaf of the data structure.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_AU2021107061A4 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Suffix Forest: A novel in-memory data structure for analyzing time-series data |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T21%3A28%3A50IST&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=Chattopadhyay,%20Samiran&rft.date=2021-12-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EAU2021107061A4%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 |