Filters








5,899 Hits in 7.2 sec

An Efficient Algorithm for Distributed Incremental Updating of Frequent Item-Sets on Massive Database [chapter]

Jiangtao Qiu, Changjie Tang, Lei Duan, Chuan Li, Shaojie Qiao, Peng Chen, Qihong Liu
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
for frequent item-sets incremental updating; (d) in order to further improve performance, proposes the algorithm DFIIU for distributed incremental updating of frequent Item-sets on massive database; (  ...  Incremental updating of frequent item-sets on a database includes three problems. In this paper, these problems are explored when database stores massive data.  ...  algorithm DFIIU (Distributed Frequent Item-sets Incremental Updating) is proposed for incremental mining frequent Item-sets on massive databases with multiple computers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11906070_6">doi:10.1007/11906070_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xcsqq3wub5gwpmsb5a4vpaib4u">fatcat:xcsqq3wub5gwpmsb5a4vpaib4u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809073651/http://teacher.scu.edu.cn/ftp_teacher0/chjtang/paper_doc/2006/Qiu-Incremental-Updating.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b6/41/b6411575878ff0f4cd83cea298cf8f78acc61544.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11906070_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Incremental Association Rule Mining Algorithm Based on Hadoop

Zhu Ying, Wang Jianguo
<span title="">2019</span> <i title="Exeley, Inc."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hjmnofjq3fccnjljb7y47mrni4" style="color: black;">International Journal of Advanced Network, Monitoring, and Controls</a> </i> &nbsp;
In combination with the tree structure, when the data in the database is constantly updated, it does not need to scan the original database to generate frequent item sets, and use the load balancing in  ...  Aiming at the problems of low efficiency, low cost of time and space, this paper proposes an incremental association rule mining algorithm based on Hadoop load balancing.  ...  Hadoop distributed platform In this era of increasing data size, the traditional frequent item set mining algorithm has been difficult to support the mining of its massive transaction database.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21307/ijanmc-2019-015">doi:10.21307/ijanmc-2019-015</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ncal53rlgvasjmemtdv626hsp4">fatcat:ncal53rlgvasjmemtdv626hsp4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200210202744/https://www.exeley.com/exeley/journals/international_journal_advanced_network_monitoring_controls/3/4/pdf/10.21307_ijanmc-2019-015.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/90/3a/903abf9c1155499a8cb0e1c4781274a6450bad1b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21307/ijanmc-2019-015"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Large-Scale Dataset Incremental Association Rules Mining Model and Optimization Algorithm

Guo Yu-Dong, Li Sheng-Lin, Li Yong-Zhi, Wang Zhao-Xia, Zeng Li
<span title="2016-04-30">2016</span> <i title="Science and Engineering Research Support Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3ditg5diardybi4jjjavndg434" style="color: black;">International Journal of Database Theory and Application</a> </i> &nbsp;
Related studies have proposed many used to efficiently find large-scale database association rules algorithm, but the research on maintenance problem of association rules is less.  ...  conditions is given incremental association rules mining algorithm, and reduce the frequency of the original dataset range query and query, and in a case of massive dataset multi-level tree structure  ...  Wang Zhao-Xia for helping me, who has provided me with valuable guidance in every stage of the writing of this thesis and taught me association rules algorithm and the main technical points of the large  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14257/ijdta.2016.9.4.18">doi:10.14257/ijdta.2016.9.4.18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tp4bagf4mnaubb74g5v3na755a">fatcat:tp4bagf4mnaubb74g5v3na755a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220224053430/http://article.nadiapub.com/IJDTA/vol9_no4/18.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4e/b2/4eb2aff99ee86ae63e5f36d546a0aeac9c6bb4bc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14257/ijdta.2016.9.4.18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Incremental mining of sequential patterns: Progress and challenges

Bhawna Mallick, Deepak Garg, P.S. Grover
<span title="2013-05-16">2013</span> <i title="IOS Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lm7wouyrqzbgvenkjxkrtwootu" style="color: black;">Intelligent Data Analysis</a> </i> &nbsp;
An analytical study, focusing on the characteristics, has been made for more than twenty incremental mining algorithms. Further, we have discussed the issues associated with each of them.  ...  Most of the basic solutions are based on the assumption that the mining is performed on static database. But modern day databases are being continuously updated and are dynamic in nature.  ...  They proposed an efficient algorithm IMCS, (Incremental Maintenance of Closed Sequential Pattern) that maintains the CSTree for the sequence database, that is updated incrementally.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3233/ida-130591">doi:10.3233/ida-130591</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ituubtk5ujca3bxmrxyl44zgdm">fatcat:ituubtk5ujca3bxmrxyl44zgdm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160806184149/http://gdeepak.com/pubs/Incremental%20sequential%20pattern%20mining.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9f/6d/9f6d9fc8fd9c36b905bd5e9736d68064fed6e78c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3233/ida-130591"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Fast Mining of Finding Frequent Patterns in Transactional Database using Incremental Approach

Pamli Basak, R.R. Sedamkar, Rashmi Thakur
<span title="2015-06-06">2015</span> <i title="Foundation of Computer Science"> International Journal of Applied Information Systems </i> &nbsp;
Also, it shortens the response time to a query for the set of frequent items.  ...  This paper presents a structure for simply, easily and competently parallelizing data mining algorithms for those huge datasets together with the incremental mining.  ...  Also, it curtails the response time to a query for the set of frequent items.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijais15-451369">doi:10.5120/ijais15-451369</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r4zg4zt7s5er3it7drvz5lap3m">fatcat:r4zg4zt7s5er3it7drvz5lap3m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921230849/http://research.ijais.org/volume9/number2/ijais15-451369.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bf/2c/bf2c568319369ef941cdcbe74a1674cf9a27910b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijais15-451369"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Network Big Data: A Literature Survey on Stream Data Mining

Yi Wu
<span title="2014-09-01">2014</span> <i title="International Academy Publishing (IAP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jr7366lnajgfrhmmgwgrpt3o7u" style="color: black;">Journal of Software</a> </i> &nbsp;
It brings great benefits for information society.  ...  With the rapid development of Internet, the internet of things and other information technology, big data usually exists in cyberspace as the form of the data stream.  ...  ACKNOWLEDGMENT This work is supported by the Nature Science Foundation of Heilongjiang Province with the grant number: F201325. The author would like to thank for their support.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4304/jsw.9.9.2427-2434">doi:10.4304/jsw.9.9.2427-2434</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u52qdqy3xbd2la5a4m3tklm5c4">fatcat:u52qdqy3xbd2la5a4m3tklm5c4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810034141/http://www.jsoftware.us/vol9/jsw0909-26.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1f/22/1f22d1764bd7067b3967f9bf8a54d8cfe5483a55.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4304/jsw.9.9.2427-2434"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Frequent Itemset Generation for Analyzing Customer Buying Nature using Bit Vector Mining

G. Harini
<span title="2019-03-31">2019</span> <i title="International Journal for Research in Applied Science and Engineering Technology (IJRASET)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hsp44774azcezeyiq4kuzpfh5a" style="color: black;">International Journal for Research in Applied Science and Engineering Technology</a> </i> &nbsp;
The paper introduces an efficient algorithm using bit vector to find frequent itemsets from a huge set of itemsets.  ...  An assortment of calculations are as of now executed for mining frequent itemsets. The Apriori and FP-growth calculation are the two most prominent ones.  ...  In this paper, the proposed technique for mining Frequent Item sets from transaction database depends on the bit vectors.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22214/ijraset.2019.3352">doi:10.22214/ijraset.2019.3352</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jiz7wz3tkzbcvofzdjgepcwnvq">fatcat:jiz7wz3tkzbcvofzdjgepcwnvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200214111538/https://www.ijraset.com/fileserve.php?FID=20553" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/b4/13b456f69a878addbe9d1d62e3d02b02e116231e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.22214/ijraset.2019.3352"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

An Efficient Incremental Mining Algorithm for Discovering Sequential Pattern in Wireless Sensor Network Environments

Xin Lyu, Hongxu Ma
<span title="2018-12-21">2018</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/taedaf6aozg7vitz5dpgkojane" style="color: black;">Sensors</a> </i> &nbsp;
In this work, an efficient incremental mining algorithm for discovering sequential pattern (novel incremental algorithm, NIA) is proposed, in order to enhance the efficiency of the whole mining process  ...  First, a reasoned proof is given to demonstrate how to update the frequent sequences incrementally, and the mining space is greatly narrowed based on the proof.  ...  The incremental mining algorithm is to discover the set of frequent sequences in UD. The updated database UD is the combination of SDB and sdb.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s19010029">doi:10.3390/s19010029</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3heo6jrz3ve4znmejatfcetf64">fatcat:3heo6jrz3ve4znmejatfcetf64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502171456/https://res.mdpi.com/sensors/sensors-19-00029/article_deploy/sensors-19-00029.pdf?filename=&amp;attachment=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d1/26/d126690494947cb54f6ec72221f0e0984f0bc7c1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/s19010029"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Optimization of Teaching Management System Based on Association Rules Algorithm

Qing Niu, Wei Wang
<span title="2021-01-29">2021</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/y3fh56bfunh5fgneywwba6d4ke" style="color: black;">Complexity</a> </i> &nbsp;
First, aiming at the low efficiency of the Apriori algorithm for mining association rules, an association rule model based on interest is proposed.  ...  Second, use the MapReduce calculation model to partition the transaction database, then use the improved Apriori optimization algorithm for mining, and finally merge the mining results to obtain frequent  ...  Conflicts of Interest e authors declare that they have no conflicts of interest regarding the publication of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/6688463">doi:10.1155/2021/6688463</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wd5kemibtvacrkcnmkrx2bslda">fatcat:wd5kemibtvacrkcnmkrx2bslda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210210072306/https://downloads.hindawi.com/journals/complexity/2021/6688463.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/88/66/886648613cf100455ae9a904d65ee0c567e11a8b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/6688463"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Analysis of Frequent Item set Mining of Electronic Evidence using ISPO Tree based on Map/Reduce

<span title="2016-01-05">2016</span> <i title="International Journal of Science and Research"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/odv46yibm5gf7evzoopmrrqr3q" style="color: black;">International Journal of Science and Research (IJSR)</a> </i> &nbsp;
Association rules can mine the relevant evidence of computer crime from the massive data and association rules among data item set, and further mine crime trends and connections among different crimes.  ...  FP-growth pattern of constant search is the most famous FIM algorithm. Incrementing data, time and space costs FP-growth will be mining algorithms bottleneck.  ...  No rescan of the entire updated database or reconstruction of a new tree is needed for incremental updating.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21275/v5i1.17121501">doi:10.21275/v5i1.17121501</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ve7x4rre55btxlybvkvenfwbly">fatcat:ve7x4rre55btxlybvkvenfwbly</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220224052501/https://www.ijsr.net/archive/v5i1/17121501.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2a/2e/2a2e51b3f449358fb9c8f6b4a12c9e7a21df2a0c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21275/v5i1.17121501"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Fast incremental mining of web sequential patterns with PLWAP tree

C. I. Ezeife, Yi Liu
<span title="2009-06-11">2009</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ja54f4dcmzfz7cvlo7o757jdba" style="color: black;">Data mining and knowledge discovery</a> </i> &nbsp;
This paper proposes two algorithms, RePL4UP (Revised PLWAP For UPdate), and PL4UP (PLWAP For UPdate), which use the PLWAP tree structure to incrementally update web sequential patterns efficiently without  ...  The position code features of the PLWAP tree are used to efficiently mine these trees to extract current frequent patterns when the database is updated. These Responsible editor: Eamonn Keogh.  ...  Acknowledgments This research was supported by the Natural Science and Engineering Research Council (NSERC) of Canada under an operating grant (OGP-0194134) and a University of Windsor grant.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10618-009-0133-6">doi:10.1007/s10618-009-0133-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6vnjwaenefbdvpfceriuvp5vgm">fatcat:6vnjwaenefbdvpfceriuvp5vgm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110331175106/http://cs.uwindsor.ca/~cezeife/repl4up.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e3/30/e3301e7904efd09dab69fa4405dfc1ff32fdafe4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10618-009-0133-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Scalable Frequent Itemset Mining Using Heterogeneous Computing : Parapriori Algorithm

V.B Nikam, B B Meshram
<span title="2014-09-30">2014</span> <i title="Academy and Industry Research Collaboration Center (AIRCC)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6vo522l2jgi3hiyio6wyab7a4" style="color: black;">International Journal of Distributed and Parallel systems</a> </i> &nbsp;
The empirical analysis of the algorithm also shows that efficiency and scalability is verified over the series of datasets experimented on many core GPU platform.  ...  In the vast increasing databases, the major challenge is the frequent itemsets mining in a very short period of time.  ...  Venkat PPK Scientific Officer from Supercomputing Section and Visualization Section respectively of Computer Division, BARC, for their timely help.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijdps.2014.5502">doi:10.5121/ijdps.2014.5502</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iozy5bptizftddm3dl7d53miwi">fatcat:iozy5bptizftddm3dl7d53miwi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180604170819/http://www.airccse.org/journal/ijdps/papers/5514ijdps02.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bd/d1/bdd1d8bf37059c5b2ec7f1324abfaac0cf2bf696.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5121/ijdps.2014.5502"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Rare pattern mining: challenges and future perspectives

Anindita Borah, Bhabesh Nath
<span title="2018-11-10">2018</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nnhntxrl5vg2zjrahf7teas5oy" style="color: black;">Complex &amp; Intelligent Systems</a> </i> &nbsp;
Extracting frequent patterns from databases has always been an imperative task for the data mining community.  ...  The application of rare pattern mining is inevitable and thus has become an emerging field of research. However, discovering rare patterns from databases comes up with numerous challenges.  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecomm ons.org/licenses/by/4.0/), which permits unrestricted use, distribution  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s40747-018-0085-9">doi:10.1007/s40747-018-0085-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y6mifzkvbzdtncvalcoageqovu">fatcat:y6mifzkvbzdtncvalcoageqovu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502235812/https://link.springer.com/content/pdf/10.1007%2Fs40747-018-0085-9.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/ea/49eabd1a7741545a6a322b9f66d21422d948b817.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s40747-018-0085-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

An analytical framework for data stream mining techniques based on challenges and requirements [article]

Mahnoosh Kholghi (Department of Electronic, Computer and IT, Islamic Azad University, Qazvin Branch, Qazvin, Iran and member of Young Researchers Club) and Mohammadreza Keyvanpour (Department of Computer Engineering Alzahra University Tehran, Iran)
<span title="2011-05-10">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper, we present the theoretical foundations of data stream analysis and propose an analytical framework for data stream mining techniques.  ...  The imminent need for turning such data into useful information and knowledge augments the development of systems, algorithms and frameworks that address streaming challenges.  ...  High complexity Frequency Counting and Time Series Analysis Approximate Frequent Counts [26] Frequent item sets -Incremental update -Simplicity -Need less memory space -Single pass -  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1105.1950v1">arXiv:1105.1950v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/36w4x5z4ibaqri6du5ojb2j4gq">fatcat:36w4x5z4ibaqri6du5ojb2j4gq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928031039/https://arxiv.org/ftp/arxiv/papers/1105/1105.1950.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/30/eb/30ebfab0dc11c065397ee22d1ad7c366a7638646.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1105.1950v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Inverted matrix

Mohammad El-Hajj, Osmar R. Zaïane
<span title="">2003</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fqqihtxlu5bvfaqxjyvqcob35a" style="color: black;">Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD &#39;03</a> </i> &nbsp;
Second, for each frequent item, a relatively small independent tree is built summarizing co-occurrences.  ...  Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets.  ...  However, the existing algorithms depend heavily on massive computation that might cause high dependency on the memory size or repeated I/O scans for the data sets.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/956750.956766">doi:10.1145/956750.956766</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kdd/El-HajjZ03.html">dblp:conf/kdd/El-HajjZ03</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gpqs34ohfrg45ge7hq23mqnc5a">fatcat:gpqs34ohfrg45ge7hq23mqnc5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120529203414/http://webdocs.cs.ualberta.ca/~zaiane/postscript/kdd03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ea/03/ea032a438ddfc78be9b11fc94152aa9c72b4e80c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/956750.956766"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 5,899 results