Frequent Pattern Retrieval on Data Streams by using Sliding Window

In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	P. Kumar [verfasserIn] P. Rao [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2021

Schlagwörter:	frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns

Übergeordnetes Werk:	In: EAI Endorsed Transactions on Energy Web - European Alliance for Innovation (EAI), 2015, 8(2021), 35
Übergeordnetes Werk:	volume:8 ; year:2021 ; number:35

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.4108/eai.13-1-2021.168091

Katalog-ID:	DOAJ01463001X

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ01463001X
003	DE-627
005	20230503072244.0
007	cr uuu---uuuuu
008	230226s2021 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.4108/eai.13-1-2021.168091 \|2 doi
035			\|a (DE-627)DOAJ01463001X
035			\|a (DE-599)DOAJc6c53fea5389429687b33eea57cdcd46
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a QA1-939
050		0	\|a QA75.5-76.95
100	0		\|a P. Kumar \|e verfasserin \|4 aut
245	1	0	\|a Frequent Pattern Retrieval on Data Streams by using Sliding Window
264		1	\|c 2021
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures.
650		4	\|a frequent pattern retrieval algorithm
650		4	\|a information extraction
650		4	\|a sliding window stream data
650		4	\|a candidate patterns
653		0	\|a Science
653		0	\|a Q
653		0	\|a Mathematics
653		0	\|a Electronic computers. Computer science
700	0		\|a P. Rao \|e verfasserin \|4 aut
773	0	8	\|i In \|t EAI Endorsed Transactions on Energy Web \|d European Alliance for Innovation (EAI), 2015 \|g 8(2021), 35 \|w (DE-627)1685394051 \|x 2032944X \|7 nnns
773	1	8	\|g volume:8 \|g year:2021 \|g number:35
856	4	0	\|u https://doi.org/10.4108/eai.13-1-2021.168091 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46 \|z kostenfrei
856	4	0	\|u https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2032-944X \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a SSG-OLC-PHA
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 8 \|j 2021 \|e 35

Indexfelder

author_variant	p k pk p r pr
matchkey_str	article:2032944X:2021----::rqetatrrtivlnaatembui
hierarchy_sort_str	2021
callnumber-subject-code	QA
publishDate	2021
allfields	10.4108/eai.13-1-2021.168091 doi (DE-627)DOAJ01463001X (DE-599)DOAJc6c53fea5389429687b33eea57cdcd46 DE-627 ger DE-627 rakwb eng QA1-939 QA75.5-76.95 P. Kumar verfasserin aut Frequent Pattern Retrieval on Data Streams by using Sliding Window 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures. frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns Science Q Mathematics Electronic computers. Computer science P. Rao verfasserin aut In EAI Endorsed Transactions on Energy Web European Alliance for Innovation (EAI), 2015 8(2021), 35 (DE-627)1685394051 2032944X nnns volume:8 year:2021 number:35 https://doi.org/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46 kostenfrei https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/toc/2032-944X Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2021 35
spelling	10.4108/eai.13-1-2021.168091 doi (DE-627)DOAJ01463001X (DE-599)DOAJc6c53fea5389429687b33eea57cdcd46 DE-627 ger DE-627 rakwb eng QA1-939 QA75.5-76.95 P. Kumar verfasserin aut Frequent Pattern Retrieval on Data Streams by using Sliding Window 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures. frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns Science Q Mathematics Electronic computers. Computer science P. Rao verfasserin aut In EAI Endorsed Transactions on Energy Web European Alliance for Innovation (EAI), 2015 8(2021), 35 (DE-627)1685394051 2032944X nnns volume:8 year:2021 number:35 https://doi.org/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46 kostenfrei https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/toc/2032-944X Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2021 35
allfields_unstemmed	10.4108/eai.13-1-2021.168091 doi (DE-627)DOAJ01463001X (DE-599)DOAJc6c53fea5389429687b33eea57cdcd46 DE-627 ger DE-627 rakwb eng QA1-939 QA75.5-76.95 P. Kumar verfasserin aut Frequent Pattern Retrieval on Data Streams by using Sliding Window 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures. frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns Science Q Mathematics Electronic computers. Computer science P. Rao verfasserin aut In EAI Endorsed Transactions on Energy Web European Alliance for Innovation (EAI), 2015 8(2021), 35 (DE-627)1685394051 2032944X nnns volume:8 year:2021 number:35 https://doi.org/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46 kostenfrei https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/toc/2032-944X Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2021 35
allfieldsGer	10.4108/eai.13-1-2021.168091 doi (DE-627)DOAJ01463001X (DE-599)DOAJc6c53fea5389429687b33eea57cdcd46 DE-627 ger DE-627 rakwb eng QA1-939 QA75.5-76.95 P. Kumar verfasserin aut Frequent Pattern Retrieval on Data Streams by using Sliding Window 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures. frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns Science Q Mathematics Electronic computers. Computer science P. Rao verfasserin aut In EAI Endorsed Transactions on Energy Web European Alliance for Innovation (EAI), 2015 8(2021), 35 (DE-627)1685394051 2032944X nnns volume:8 year:2021 number:35 https://doi.org/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46 kostenfrei https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/toc/2032-944X Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2021 35
allfieldsSound	10.4108/eai.13-1-2021.168091 doi (DE-627)DOAJ01463001X (DE-599)DOAJc6c53fea5389429687b33eea57cdcd46 DE-627 ger DE-627 rakwb eng QA1-939 QA75.5-76.95 P. Kumar verfasserin aut Frequent Pattern Retrieval on Data Streams by using Sliding Window 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures. frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns Science Q Mathematics Electronic computers. Computer science P. Rao verfasserin aut In EAI Endorsed Transactions on Energy Web European Alliance for Innovation (EAI), 2015 8(2021), 35 (DE-627)1685394051 2032944X nnns volume:8 year:2021 number:35 https://doi.org/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46 kostenfrei https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091 kostenfrei https://doaj.org/toc/2032-944X Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 8 2021 35
language	English
source	In EAI Endorsed Transactions on Energy Web 8(2021), 35 volume:8 year:2021 number:35
sourceStr	In EAI Endorsed Transactions on Energy Web 8(2021), 35 volume:8 year:2021 number:35
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns Science Q Mathematics Electronic computers. Computer science
isfreeaccess_bool	true
container_title	EAI Endorsed Transactions on Energy Web
authorswithroles_txt_mv	P. Kumar @@aut@@ P. Rao @@aut@@
publishDateDaySort_date	2021-01-01T00:00:00Z
hierarchy_top_id	1685394051
id	DOAJ01463001X
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ01463001X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503072244.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4108/eai.13-1-2021.168091</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ01463001X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJc6c53fea5389429687b33eea57cdcd46</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5-76.95</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">P. Kumar</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Frequent Pattern Retrieval on Data Streams by using Sliding Window</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">frequent pattern retrieval algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">information extraction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sliding window stream data</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">candidate patterns</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Science</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Q</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic computers. Computer science</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">P. Rao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">EAI Endorsed Transactions on Energy Web</subfield><subfield code="d">European Alliance for Innovation (EAI), 2015</subfield><subfield code="g">8(2021), 35</subfield><subfield code="w">(DE-627)1685394051</subfield><subfield code="x">2032944X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:35</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.4108/eai.13-1-2021.168091</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2032-944X</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2021</subfield><subfield code="e">35</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	P. Kumar
spellingShingle	P. Kumar misc QA1-939 misc QA75.5-76.95 misc frequent pattern retrieval algorithm misc information extraction misc sliding window stream data misc candidate patterns misc Science misc Q misc Mathematics misc Electronic computers. Computer science Frequent Pattern Retrieval on Data Streams by using Sliding Window
authorStr	P. Kumar
ppnlink_with_tag_str_mv	@@773@@(DE-627)1685394051
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	QA1-939
illustrated	Not Illustrated
issn	2032944X
topic_title	QA1-939 QA75.5-76.95 Frequent Pattern Retrieval on Data Streams by using Sliding Window frequent pattern retrieval algorithm information extraction sliding window stream data candidate patterns
topic	misc QA1-939 misc QA75.5-76.95 misc frequent pattern retrieval algorithm misc information extraction misc sliding window stream data misc candidate patterns misc Science misc Q misc Mathematics misc Electronic computers. Computer science
topic_unstemmed	misc QA1-939 misc QA75.5-76.95 misc frequent pattern retrieval algorithm misc information extraction misc sliding window stream data misc candidate patterns misc Science misc Q misc Mathematics misc Electronic computers. Computer science
topic_browse	misc QA1-939 misc QA75.5-76.95 misc frequent pattern retrieval algorithm misc information extraction misc sliding window stream data misc candidate patterns misc Science misc Q misc Mathematics misc Electronic computers. Computer science
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	EAI Endorsed Transactions on Energy Web
hierarchy_parent_id	1685394051
hierarchy_top_title	EAI Endorsed Transactions on Energy Web
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)1685394051
title	Frequent Pattern Retrieval on Data Streams by using Sliding Window
ctrlnum	(DE-627)DOAJ01463001X (DE-599)DOAJc6c53fea5389429687b33eea57cdcd46
title_full	Frequent Pattern Retrieval on Data Streams by using Sliding Window
author_sort	P. Kumar
journal	EAI Endorsed Transactions on Energy Web
journalStr	EAI Endorsed Transactions on Energy Web
callnumber-first-code	Q
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2021
contenttype_str_mv	txt
author_browse	P. Kumar P. Rao
container_volume	8
class	QA1-939 QA75.5-76.95
format_se	Elektronische Aufsätze
author-letter	P. Kumar
doi_str_mv	10.4108/eai.13-1-2021.168091
author2-role	verfasserin
title_sort	frequent pattern retrieval on data streams by using sliding window
callnumber	QA1-939
title_auth	Frequent Pattern Retrieval on Data Streams by using Sliding Window
abstract	In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures.
abstractGer	In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures.
abstract_unstemmed	In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	35
title_short	Frequent Pattern Retrieval on Data Streams by using Sliding Window
url	https://doi.org/10.4108/eai.13-1-2021.168091 https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46 https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091 https://doaj.org/toc/2032-944X
remote_bool	true
author2	P. Rao
author2Str	P. Rao
ppnlink	1685394051
callnumber-subject	QA - Mathematics
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.4108/eai.13-1-2021.168091
callnumber-a	QA1-939
up_date	2024-07-03T23:52:37.427Z
_version_	1803603943022919680
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ01463001X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503072244.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4108/eai.13-1-2021.168091</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ01463001X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJc6c53fea5389429687b33eea57cdcd46</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5-76.95</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">P. Kumar</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Frequent Pattern Retrieval on Data Streams by using Sliding Window</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In different applications like recommender frameworks and market examination, regular patterns play a significant role in useful mining data. Mining regular patterns from sliding windows over streaming information has become a complex task. In this examination, the sliding window is utilized to build the framework and FP tree applied to mine the dataset's valuable data. The sliding window has the arrangement of patterns put away in the Matrix, which contains the transaction in the sliding information and thenapplied to the FP tree. In this paper, the Frequent Pattern Retrieval strategy is planned by utilizing anFP tree approach and a sliding window model to extract noteworthy examples from data streams. The proposed technique accomplished less runtime with low memory use for the Breast disease dataset and different datasets to run the least utility edge contrasted with different existing procedures.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">frequent pattern retrieval algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">information extraction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sliding window stream data</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">candidate patterns</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Science</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Q</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic computers. Computer science</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">P. Rao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">EAI Endorsed Transactions on Energy Web</subfield><subfield code="d">European Alliance for Innovation (EAI), 2015</subfield><subfield code="g">8(2021), 35</subfield><subfield code="w">(DE-627)1685394051</subfield><subfield code="x">2032944X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:35</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.4108/eai.13-1-2021.168091</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/c6c53fea5389429687b33eea57cdcd46</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://eudl.eu/pdf/10.4108/eai.13-1-2021.168091</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2032-944X</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">2021</subfield><subfield code="e">35</subfield></datafield></record></collection>
score	7.399686

Nicht das Richtige dabei?

Schreiben Sie uns!

Frequent Pattern Retrieval on Data Streams by using Sliding Window

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?