CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>   <script> var _paq = window._paq = window._paq || []; /* tracker methods like "setCustomDimension" should be called before "trackPageView" */ _paq.push(['trackPageView']); _paq.push(['enableLinkTracking']); (function() { var u="//matomo.waset.org/"; _paq.push(['setTrackerUrl', u+'matomo.php']); _paq.push(['setSiteId', '2']); var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0]; g.async=true; g.src=u+'matomo.js'; s.parentNode.insertBefore(g,s); })(); </script>  <title>Search results for: distributed data mining</title> <meta name="description" content="Search results for: distributed data mining"> <meta name="keywords" content="distributed data mining"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="distributed data mining" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2025/2026/2027">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="distributed data mining"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 27227</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: distributed data mining</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27227</span> Business-Intelligence Mining of Large Decentralized Multimedia Datasets with a Distributed Multi-Agent System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karima%20Qayumi">Karima Qayumi</a>, <a href="https://publications.waset.org/abstracts/search?q=Alex%20Norta"> Alex Norta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid generation of high volume and a broad variety of data from the application of new technologies pose challenges for the generation of business-intelligence. Most organizations and business owners need to extract data from multiple sources and apply analytical methods for the purposes of developing their business. Therefore, the recently decentralized data management environment is relying on a distributed computing paradigm. While data are stored in highly distributed systems, the implementation of distributed data-mining techniques is a challenge. The aim of this technique is to gather knowledge from every domain and all the datasets stemming from distributed resources. As agent technologies offer significant contributions for managing the complexity of distributed systems, we consider this for next-generation data-mining processes. To demonstrate agent-based business intelligence operations, we use agent-oriented modeling techniques to develop a new artifact for mining massive datasets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agent-oriented%20modeling%20%28AOM%29" title="agent-oriented modeling (AOM)">agent-oriented modeling (AOM)</a>, <a href="https://publications.waset.org/abstracts/search?q=business%20intelligence%20model%20%28BIM%29" title=" business intelligence model (BIM)"> business intelligence model (BIM)</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining%20%28DDM%29" title=" distributed data mining (DDM)"> distributed data mining (DDM)</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-agent%20system%20%28MAS%29" title=" multi-agent system (MAS)"> multi-agent system (MAS)</a> </p> <a href="https://publications.waset.org/abstracts/44164/business-intelligence-mining-of-large-decentralized-multimedia-datasets-with-a-distributed-multi-agent-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44164.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">438</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27226</span> Reviewing Privacy Preserving Distributed Data Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sajjad%20Baghernezhad">Sajjad Baghernezhad</a>, <a href="https://publications.waset.org/abstracts/search?q=Saeideh%20Baghernezhad"> Saeideh Baghernezhad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays considering human involved in increasing data development some methods such as data mining to extract science are unavoidable. One of the discussions of data mining is inherent distribution of the data usually the bases creating or receiving such data belong to corporate or non-corporate persons and do not give their information freely to others. Yet there is no guarantee to enable someone to mine special data without entering in the owner’s privacy. Sending data and then gathering them by each vertical or horizontal software depends on the type of their preserving type and also executed to improve data privacy. In this study it was attempted to compare comprehensively preserving data methods; also general methods such as random data, coding and strong and weak points of each one are examined. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining" title=" distributed data mining"> distributed data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy%20protection" title=" privacy protection"> privacy protection</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy%20preserving" title=" privacy preserving"> privacy preserving</a> </p> <a href="https://publications.waset.org/abstracts/28876/reviewing-privacy-preserving-distributed-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28876.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">533</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27225</span> Optimizing Communications Overhead in Heterogeneous Distributed Data Streams</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rashi%20Bhalla">Rashi Bhalla</a>, <a href="https://publications.waset.org/abstracts/search?q=Russel%20Pears"> Russel Pears</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Asif%20Naeem"> M. Asif Naeem</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this 'Information Explosion Era' analyzing data 'a critical commodity' and mining knowledge from vertically distributed data stream incurs huge communication cost. However, an effort to decrease the communication in the distributed environment has an adverse influence on the classification accuracy; therefore, a research challenge lies in maintaining a balance between transmission cost and accuracy. This paper proposes a method based on Bayesian inference to reduce the communication volume in a heterogeneous distributed environment while retaining prediction accuracy. Our experimental evaluation reveals that a significant reduction in communication can be achieved across a diverse range of dataset types. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=bayesian%20inference" title=" bayesian inference"> bayesian inference</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20data%20stream%20mining" title=" distributed data stream mining"> distributed data stream mining</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous-distributed%20data" title=" heterogeneous-distributed data"> heterogeneous-distributed data</a> </p> <a href="https://publications.waset.org/abstracts/124886/optimizing-communications-overhead-in-heterogeneous-distributed-data-streams" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124886.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">167</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27224</span> HPPDFIM-HD: Transaction Distortion and Connected Perturbation Approach for Hierarchical Privacy Preserving Distributed Frequent Itemset Mining over Horizontally-Partitioned Dataset</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuad%20Ali%20Mohammed%20Al-Yarimi">Fuad Ali Mohammed Al-Yarimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many algorithms have been proposed to provide privacy preserving in data mining. These protocols are based on two main approaches named as: the perturbation approach and the Cryptographic approach. The first one is based on perturbation of the valuable information while the second one uses cryptographic techniques. The perturbation approach is much more efficient with reduced accuracy while the cryptographic approach can provide solutions with perfect accuracy. However, the cryptographic approach is a much slower method and requires considerable computation and communication overhead. In this paper, a new scalable protocol is proposed which combines the advantages of the perturbation and distortion along with cryptographic approach to perform privacy preserving in distributed frequent itemset mining on horizontally distributed data. Both the privacy and performance characteristics of the proposed protocol are studied empirically. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anonymity%20data" title="anonymity data">anonymity data</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20frequent%20itemset%20mining" title=" distributed frequent itemset mining"> distributed frequent itemset mining</a>, <a href="https://publications.waset.org/abstracts/search?q=gaussian%20perturbation" title=" gaussian perturbation"> gaussian perturbation</a>, <a href="https://publications.waset.org/abstracts/search?q=perturbation%20approach" title=" perturbation approach"> perturbation approach</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy%20preserving%20data%20mining" title=" privacy preserving data mining"> privacy preserving data mining</a> </p> <a href="https://publications.waset.org/abstracts/20805/hppdfim-hd-transaction-distortion-and-connected-perturbation-approach-for-hierarchical-privacy-preserving-distributed-frequent-itemset-mining-over-horizontally-partitioned-dataset" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20805.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">510</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27223</span> Towards a Distributed Computation Platform Tailored for Educational Process Discovery and Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Awatef%20Hicheur%20Cairns">Awatef Hicheur Cairns</a>, <a href="https://publications.waset.org/abstracts/search?q=Billel%20Gueni"> Billel Gueni</a>, <a href="https://publications.waset.org/abstracts/search?q=Hind%20Hafdi"> Hind Hafdi</a>, <a href="https://publications.waset.org/abstracts/search?q=Christian%20Joubert"> Christian Joubert</a>, <a href="https://publications.waset.org/abstracts/search?q=Nasser%20Khelifa"> Nasser Khelifa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given the ever changing needs of the job markets, education and training centers are increasingly held accountable for student success. Therefore, education and training centers have to focus on ways to streamline their offers and educational processes in order to achieve the highest level of quality in curriculum contents and managerial decisions. Educational process mining is an emerging field in the educational data mining (EDM) discipline, concerned with developing methods to discover, analyze and provide a visual representation of complete educational processes. In this paper, we present our distributed computation platform which allows different education centers and institutions to load their data and access to advanced data mining and process mining services. To achieve this, we present also a comparative study of the different clustering techniques developed in the context of process mining to partition efficiently educational traces. Our goal is to find the best strategy for distributing heavy analysis computations on many processing nodes of our platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=educational%20process%20mining" title="educational process mining">educational process mining</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20process%20mining" title=" distributed process mining"> distributed process mining</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20platform" title=" distributed platform"> distributed platform</a>, <a href="https://publications.waset.org/abstracts/search?q=educational%20data%20mining" title=" educational data mining"> educational data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=ProM" title=" ProM"> ProM</a> </p> <a href="https://publications.waset.org/abstracts/27675/towards-a-distributed-computation-platform-tailored-for-educational-process-discovery-and-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27675.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">459</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27222</span> Cloud Computing in Data Mining: A Technical Survey</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghaemi%20Reza">Ghaemi Reza</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdollahi%20Hamid"> Abdollahi Hamid</a>, <a href="https://publications.waset.org/abstracts/search?q=Dashti%20Elham"> Dashti Elham</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing poses a diversity of challenges in data mining operation arising out of the dynamic structure of data distribution as against the use of typical database scenarios in conventional architecture. Due to immense number of users seeking data on daily basis, there is a serious security concerns to cloud providers as well as data providers who put their data on the cloud computing environment. Big data analytics use compute intensive data mining algorithms (Hidden markov, MapReduce parallel programming, Mahot Project, Hadoop distributed file system, K-Means and KMediod, Apriori) that require efficient high performance processors to produce timely results. Data mining algorithms to solve or optimize the model parameters. The challenges that operation has to encounter is the successful transactions to be established with the existing virtual machine environment and the databases to be kept under the control. Several factors have led to the distributed data mining from normal or centralized mining. The approach is as a SaaS which uses multi-agent systems for implementing the different tasks of system. There are still some problems of data mining based on cloud computing, including design and selection of data mining algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=computing%20models" title=" computing models"> computing models</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20services" title=" cloud services"> cloud services</a> </p> <a href="https://publications.waset.org/abstracts/17331/cloud-computing-in-data-mining-a-technical-survey" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17331.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">485</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27221</span> An Adaptive Distributed Incremental Association Rule Mining System </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adewale%20O.%20Ogunde">Adewale O. Ogunde</a>, <a href="https://publications.waset.org/abstracts/search?q=Olusegun%20Folorunso"> Olusegun Folorunso</a>, <a href="https://publications.waset.org/abstracts/search?q=Adesina%20S.%20Sodiya"> Adesina S. Sodiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Most existing Distributed Association Rule Mining (DARM) systems are still facing several challenges. One of such challenges that have not received the attention of many researchers is the inability of existing systems to adapt to constantly changing databases and mining environments. In this work, an Adaptive Incremental Mining Algorithm (AIMA) is therefore proposed to address these problems. AIMA employed multiple mobile agents for the entire mining process. AIMA was designed to adapt to changes in the distributed databases by mining only the incremental database updates and using this to update the existing rules in order to improve the overall response time of the DARM system. In AIMA, global association rules were integrated incrementally from one data site to another through Results Integration Coordinating Agents. The mining agents in AIMA were made adaptive by defining mining goals with reasoning and behavioral capabilities and protocols that enabled them to either maintain or change their goals. AIMA employed Java Agent Development Environment Extension for designing the internal agents’ architecture. Results from experiments conducted on real datasets showed that the adaptive system, AIMA performed better than the non-adaptive systems with lower communication costs and higher task completion rates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptivity" title="adaptivity">adaptivity</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20association%20rule%20mining" title=" distributed association rule mining"> distributed association rule mining</a>, <a href="https://publications.waset.org/abstracts/search?q=incremental%20mining" title=" incremental mining"> incremental mining</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20agents" title=" mobile agents"> mobile agents</a> </p> <a href="https://publications.waset.org/abstracts/10014/an-adaptive-distributed-incremental-association-rule-mining-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10014.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">398</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27220</span> Block Mining: Block Chain Enabled Process Mining Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=James%20Newman">James Newman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Process mining is an emerging technology that looks to serialize enterprise data in time series data. It has been used by many companies and has been the subject of a variety of research papers. However, the majority of current efforts have looked at how to best create process mining from standard relational databases. This paper is the first pass at outlining a database custom-built for the minimal viable product of process mining. We present Block Miner, a blockchain protocol to store process mining data across a distributed network. We demonstrate the feasibility of storing process mining data on the blockchain. We present a proof of concept and show how the intersection of these two technologies helps to solve a variety of issues, including but not limited to ransomware attacks, tax documentation, and conflict resolution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blockchain" title="blockchain">blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20mining" title=" process mining"> process mining</a>, <a href="https://publications.waset.org/abstracts/search?q=memory%20optimization" title=" memory optimization"> memory optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=protocol" title=" protocol"> protocol</a> </p> <a href="https://publications.waset.org/abstracts/166846/block-mining-block-chain-enabled-process-mining-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166846.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">110</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27219</span> Distributed Perceptually Important Point Identification for Time Series Data Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tak-Chung%20Fu">Tak-Chung Fu</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying-Kit%20Hung"> Ying-Kit Hung</a>, <a href="https://publications.waset.org/abstracts/search?q=Fu-Lai%20Chung"> Fu-Lai Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the field of time series data mining, the concept of the Perceptually Important Point (PIP) identification process is first introduced in 2001. This process originally works for financial time series pattern matching and it is then found suitable for time series dimensionality reduction and representation. Its strength is on preserving the overall shape of the time series by identifying the salient points in it. With the rise of Big Data, time series data contributes a major proportion, especially on the data which generates by sensors in the Internet of Things (IoT) environment. According to the nature of PIP identification and the successful cases, it is worth to further explore the opportunity to apply PIP in time series ‘Big Data’. However, the performance of PIP identification is always considered as the limitation when dealing with ‘Big’ time series data. In this paper, two distributed versions of PIP identification based on the Specialized Binary (SB) Tree are proposed. The proposed approaches solve the bottleneck when running the PIP identification process in a standalone computer. Improvement in term of speed is obtained by the distributed versions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20computing" title="distributed computing">distributed computing</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20analysis" title=" performance analysis"> performance analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=Perceptually%20Important%20Point%20identification" title=" Perceptually Important Point identification"> Perceptually Important Point identification</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20series%20data%20mining" title=" time series data mining"> time series data mining</a> </p> <a href="https://publications.waset.org/abstracts/84358/distributed-perceptually-important-point-identification-for-time-series-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84358.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">441</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27218</span> Mining Big Data in Telecommunications Industry: Challenges, Techniques, and Revenue Opportunity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hoda%20A.%20Abdel%20Hafez">Hoda A. Abdel Hafez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mining big data represents a big challenge nowadays. Many types of research are concerned with mining massive amounts of data and big data streams. Mining big data faces a lot of challenges including scalability, speed, heterogeneity, accuracy, provenance and privacy. In telecommunication industry, mining big data is like a mining for gold; it represents a big opportunity and maximizing the revenue streams in this industry. This paper discusses the characteristics of big data (volume, variety, velocity and veracity), data mining techniques and tools for handling very large data sets, mining big data in telecommunication and the benefits and opportunities gained from them. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mining%20big%20data" title="mining big data">mining big data</a>, <a href="https://publications.waset.org/abstracts/search?q=big%20data" title=" big data"> big data</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=telecommunication" title=" telecommunication"> telecommunication</a> </p> <a href="https://publications.waset.org/abstracts/41412/mining-big-data-in-telecommunications-industry-challenges-techniques-and-revenue-opportunity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41412.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">418</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27217</span> A Review Paper on Data Mining and Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sikander%20Singh%20Cheema">Sikander Singh Cheema</a>, <a href="https://publications.waset.org/abstracts/search?q=Jasmeen%20Kaur"> Jasmeen Kaur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the concept of data mining is summarized and its one of the important process i.e KDD is summarized. The data mining based on Genetic Algorithm is researched in and ways to achieve the data mining Genetic Algorithm are surveyed. This paper also conducts a formal review on the area of data mining tasks and genetic algorithm in various fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=KDD" title=" KDD"> KDD</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=descriptive%20mining" title=" descriptive mining"> descriptive mining</a>, <a href="https://publications.waset.org/abstracts/search?q=predictive%20mining" title=" predictive mining"> predictive mining</a> </p> <a href="https://publications.waset.org/abstracts/43637/a-review-paper-on-data-mining-and-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43637.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">597</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27216</span> A Comprehensive Survey and Improvement to Existing Privacy Preserving Data Mining Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tosin%20Ige">Tosin Ige</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ethics must be a condition of the world, like logic. (Ludwig Wittgenstein, 1889-1951). As important as data mining is, it possess a significant threat to ethics, privacy, and legality, since data mining makes it difficult for an individual or consumer (in the case of a company) to control the accessibility and usage of his data. This research focuses on Current issues and the latest research and development on Privacy preserving data mining methods as at year 2022. It also discusses some advances in those techniques while at the same time highlighting and providing a new technique as a solution to an existing technique of privacy preserving data mining methods. This paper also bridges the wide gap between Data mining and the Web Application Programing Interface (web API), where research is urgently needed for an added layer of security in data mining while at the same time introducing a seamless and more efficient way of data mining. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data" title="data">data</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy" title=" privacy"> privacy</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rule" title=" association rule"> association rule</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy%20preserving" title=" privacy preserving"> privacy preserving</a>, <a href="https://publications.waset.org/abstracts/search?q=mining%20technique" title=" mining technique"> mining technique</a> </p> <a href="https://publications.waset.org/abstracts/145870/a-comprehensive-survey-and-improvement-to-existing-privacy-preserving-data-mining-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145870.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">182</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27215</span> Frequent Item Set Mining for Big Data Using MapReduce Framework</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tamanna%20Jethava">Tamanna Jethava</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahul%20Joshi"> Rahul Joshi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Frequent Item sets play an essential role in many data Mining tasks that try to find interesting patterns from the database. Typically it refers to a set of items that frequently appear together in transaction dataset. There are several mining algorithm being used for frequent item set mining, yet most do not scale to the type of data we presented with today, so called “BIG DATA”. Big Data is a collection of large data sets. Our approach is to work on the frequent item set mining over the large dataset with scalable and speedy way. Big Data basically works with Map Reduce along with HDFS is used to find out frequent item sets from Big Data on large cluster. This paper focuses on using pre-processing & mining algorithm as hybrid approach for big data over Hadoop platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequent%20item%20set%20mining" title="frequent item set mining">frequent item set mining</a>, <a href="https://publications.waset.org/abstracts/search?q=big%20data" title=" big data"> big data</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadoop" title=" Hadoop"> Hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=MapReduce" title=" MapReduce"> MapReduce</a> </p> <a href="https://publications.waset.org/abstracts/49592/frequent-item-set-mining-for-big-data-using-mapreduce-framework" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49592.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">451</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27214</span> Algorithms used in Spatial Data Mining GIS</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vahid%20Bairami%20Rad">Vahid Bairami Rad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Extracting knowledge from spatial data like GIS data is important to reduce the data and extract information. Therefore, the development of new techniques and tools that support the human in transforming data into useful knowledge has been the focus of the relatively new and interdisciplinary research area ‘knowledge discovery in databases’. Thus, we introduce a set of database primitives or basic operations for spatial data mining which are sufficient to express most of the spatial data mining algorithms from the literature. This approach has several advantages. Similar to the relational standard language SQL, the use of standard primitives will speed-up the development of new data mining algorithms and will also make them more portable. We introduced a database-oriented framework for spatial data mining which is based on the concepts of neighborhood graphs and paths. A small set of basic operations on these graphs and paths were defined as database primitives for spatial data mining. Furthermore, techniques to efficiently support the database primitives by a commercial DBMS were presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spatial%20data%20base" title="spatial data base">spatial data base</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery%20database" title=" knowledge discovery database"> knowledge discovery database</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20relationship" title=" spatial relationship"> spatial relationship</a>, <a href="https://publications.waset.org/abstracts/search?q=predictive%20data%20mining" title=" predictive data mining"> predictive data mining</a> </p> <a href="https://publications.waset.org/abstracts/29004/algorithms-used-in-spatial-data-mining-gis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29004.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">466</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27213</span> Healthcare Data Mining Innovations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eugenia%20Jilinguirian">Eugenia Jilinguirian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the healthcare industry, data mining is essential since it transforms the field by collecting useful data from large datasets. Data mining is the process of applying advanced analytical methods to large patient records and medical histories in order to identify patterns, correlations, and trends. Healthcare professionals can improve diagnosis accuracy, uncover hidden linkages, and predict disease outcomes by carefully examining these statistics. Additionally, data mining supports personalized medicine by personalizing treatment according to the unique attributes of each patient. This proactive strategy helps allocate resources more efficiently, enhances patient care, and streamlines operations. However, to effectively apply data mining, however, and ensure the use of private healthcare information, issues like data privacy and security must be carefully considered. Data mining continues to be vital for searching for more effective, efficient, and individualized healthcare solutions as technology evolves. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=healthcare" title=" healthcare"> healthcare</a>, <a href="https://publications.waset.org/abstracts/search?q=big%20data" title=" big data"> big data</a>, <a href="https://publications.waset.org/abstracts/search?q=individualised%20healthcare" title=" individualised healthcare"> individualised healthcare</a>, <a href="https://publications.waset.org/abstracts/search?q=healthcare%20solutions" title=" healthcare solutions"> healthcare solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a> </p> <a href="https://publications.waset.org/abstracts/178640/healthcare-data-mining-innovations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/178640.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">72</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27212</span> Data Mining Practices: Practical Studies on the Telecommunication Companies in Jordan </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dina%20Ahmad%20Alkhodary">Dina Ahmad Alkhodary</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study aimed to investigate the practices of Data Mining on the telecommunication companies in Jordan, from the viewpoint of the respondents. In order to achieve the goal of the study, and test the validity of hypotheses, the researcher has designed a questionnaire to collect data from managers and staff members from main department in the researched companies. The results shows improvements stages of the telecommunications companies towered Data Mining. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data" title="data">data</a>, <a href="https://publications.waset.org/abstracts/search?q=mining" title=" mining"> mining</a>, <a href="https://publications.waset.org/abstracts/search?q=development" title=" development"> development</a>, <a href="https://publications.waset.org/abstracts/search?q=business" title=" business"> business</a> </p> <a href="https://publications.waset.org/abstracts/29559/data-mining-practices-practical-studies-on-the-telecommunication-companies-in-jordan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29559.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">501</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27211</span> Recent Advances in Data Warehouse</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fahad%20Hanash%20Alzahrani">Fahad Hanash Alzahrani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes some recent advances in a quickly developing area of data storing and processing based on Data Warehouses and Data Mining techniques, which are associated with software, hardware, data mining algorithms and visualisation techniques having common features for any specific problems and tasks of their implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20warehouse" title="data warehouse">data warehouse</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery%20in%20databases" title=" knowledge discovery in databases"> knowledge discovery in databases</a>, <a href="https://publications.waset.org/abstracts/search?q=on-line%20analytical%20processing" title=" on-line analytical processing"> on-line analytical processing</a> </p> <a href="https://publications.waset.org/abstracts/63299/recent-advances-in-data-warehouse" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63299.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">409</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27210</span> Relay Mining: Verifiable Multi-Tenant Distributed Rate Limiting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Olshansky">Daniel Olshansky</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramiro%20Rodr%C4%B1guez%20Colmeiro"> Ramiro Rodrıguez Colmeiro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Relay Mining presents a scalable solution employing probabilistic mechanisms and crypto-economic incentives to estimate RPC volume usage, facilitating decentralized multitenant rate limiting. Network traffic from individual applications can be concurrently serviced by multiple RPC service providers, with costs, rewards, and rate limiting governed by a native cryptocurrency on a distributed ledger. Building upon established research in token bucket algorithms and distributed rate-limiting penalty models, our approach harnesses a feedback loop control mechanism to adjust the difficulty of mining relay rewards, dynamically scaling with network usage growth. By leveraging crypto-economic incentives, we reduce coordination overhead costs and introduce a mechanism for providing RPC services that are both geopolitically and geographically distributed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=remote%20procedure%20call" title="remote procedure call">remote procedure call</a>, <a href="https://publications.waset.org/abstracts/search?q=crypto-economic" title=" crypto-economic"> crypto-economic</a>, <a href="https://publications.waset.org/abstracts/search?q=commit-reveal" title=" commit-reveal"> commit-reveal</a>, <a href="https://publications.waset.org/abstracts/search?q=decentralization" title=" decentralization"> decentralization</a>, <a href="https://publications.waset.org/abstracts/search?q=scalability" title=" scalability"> scalability</a>, <a href="https://publications.waset.org/abstracts/search?q=blockchain" title=" blockchain"> blockchain</a>, <a href="https://publications.waset.org/abstracts/search?q=rate%20limiting" title=" rate limiting"> rate limiting</a>, <a href="https://publications.waset.org/abstracts/search?q=token%20bucket" title=" token bucket"> token bucket</a> </p> <a href="https://publications.waset.org/abstracts/177065/relay-mining-verifiable-multi-tenant-distributed-rate-limiting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177065.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">58</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27209</span> Data Stream Association Rule Mining with Cloud Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Suraj%20Aravind">B. Suraj Aravind</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20H.%20M.%20Krishna%20Prasad"> M. H. M. Krishna Prasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There exist emerging applications of data streams that require association rule mining, such as network traffic monitoring, web click streams analysis, sensor data, data from satellites etc. Data streams typically arrive continuously in high speed with huge amount and changing data distribution. This raises new issues that need to be considered when developing association rule mining techniques for stream data. This paper proposes to introduce an improved data stream association rule mining algorithm by eliminating the limitation of resources. For this, the concept of cloud computing is used. Inclusion of this may lead to additional unknown problems which needs further research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20stream" title="data stream">data stream</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rule%20mining" title=" association rule mining"> association rule mining</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=frequent%20itemsets" title=" frequent itemsets"> frequent itemsets</a> </p> <a href="https://publications.waset.org/abstracts/10064/data-stream-association-rule-mining-with-cloud-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10064.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">506</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27208</span> Privacy Preserving in Association Rule Mining on Horizontally Partitioned Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manvar%20Sagar">Manvar Sagar</a>, <a href="https://publications.waset.org/abstracts/search?q=Nikul%20Virpariya"> Nikul Virpariya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The advancement in data mining techniques plays an important role in many applications. In context of privacy and security issues, the problems caused by association rule mining technique are investigated by many research scholars. It is proved that the misuse of this technique may reveal the database owner’s sensitive and private information to others. Many researchers have put their effort to preserve privacy in Association Rule Mining. Amongst the two basic approaches for privacy preserving data mining, viz. Randomization based and Cryptography based, the later provides high level of privacy but incurs higher computational as well as communication overhead. Hence, it is necessary to explore alternative techniques that improve the over-heads. In this work, we propose an efficient, collusion-resistant cryptography based approach for distributed Association Rule mining using Shamir’s secret sharing scheme. As we show from theoretical and practical analysis, our approach is provably secure and require only one time a trusted third party. We use secret sharing for privately sharing the information and code based identification scheme to add support against malicious adversaries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Privacy" title="Privacy">Privacy</a>, <a href="https://publications.waset.org/abstracts/search?q=Privacy%20Preservation%20in%20Data%20Mining%20%28PPDM%29" title=" Privacy Preservation in Data Mining (PPDM)"> Privacy Preservation in Data Mining (PPDM)</a>, <a href="https://publications.waset.org/abstracts/search?q=horizontally%20partitioned%20database" title=" horizontally partitioned database"> horizontally partitioned database</a>, <a href="https://publications.waset.org/abstracts/search?q=EMHS" title=" EMHS"> EMHS</a>, <a href="https://publications.waset.org/abstracts/search?q=MFI" title=" MFI"> MFI</a>, <a href="https://publications.waset.org/abstracts/search?q=shamir%20secret%20sharing" title=" shamir secret sharing"> shamir secret sharing</a> </p> <a href="https://publications.waset.org/abstracts/20983/privacy-preserving-in-association-rule-mining-on-horizontally-partitioned-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20983.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">414</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27207</span> A Modular Framework for Enabling Analysis for Educators with Different Levels of Data Mining Skills</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kyle%20De%20Freitas">Kyle De Freitas</a>, <a href="https://publications.waset.org/abstracts/search?q=Margaret%20Bernard"> Margaret Bernard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Enabling data mining analysis among a wider audience of educators is an active area of research within the educational data mining (EDM) community. The paper proposes a framework for developing an environment that caters for educators who have little technical data mining skills as well as for more advanced users with some data mining expertise. This framework architecture was developed through the review of the strengths and weaknesses of existing models in the literature. The proposed framework provides a modular architecture for future researchers to focus on the development of specific areas within the EDM process. Finally, the paper also highlights a strategy of enabling analysis through either the use of predefined questions or a guided data mining process and highlights how the developed questions and analysis conducted can be reused and extended over time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=educational%20data%20mining" title="educational data mining">educational data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20management%20system" title=" learning management system"> learning management system</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20analytics" title=" learning analytics"> learning analytics</a>, <a href="https://publications.waset.org/abstracts/search?q=EDM%20framework" title=" EDM framework"> EDM framework</a> </p> <a href="https://publications.waset.org/abstracts/78786/a-modular-framework-for-enabling-analysis-for-educators-with-different-levels-of-data-mining-skills" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78786.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">333</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27206</span> Association Rules Mining Task Using Metaheuristics: Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abir%20Derouiche">Abir Derouiche</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdesslem%20Layeb"> Abdesslem Layeb </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Association Rule Mining (ARM) is one of the most popular data mining tasks and it is widely used in various areas. The search for association rules is an NP-complete problem that is why metaheuristics have been widely used to solve it. The present paper presents the ARM as an optimization problem and surveys the proposed approaches in the literature based on metaheuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Optimization" title="Optimization">Optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Metaheuristics" title=" Metaheuristics"> Metaheuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=Data%20Mining" title=" Data Mining"> Data Mining</a>, <a href="https://publications.waset.org/abstracts/search?q=Association%20rules%20Mining" title=" Association rules Mining"> Association rules Mining</a> </p> <a href="https://publications.waset.org/abstracts/120254/association-rules-mining-task-using-metaheuristics-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120254.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">165</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27205</span> Association Rules Mining and NOSQL Oriented Document in Big Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sarra%20Senhadji">Sarra Senhadji</a>, <a href="https://publications.waset.org/abstracts/search?q=Imene%20Benzeguimi"> Imene Benzeguimi</a>, <a href="https://publications.waset.org/abstracts/search?q=Zohra%20Yagoub"> Zohra Yagoub</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Big Data represents the recent technology of manipulating voluminous and unstructured data sets over multiple sources. Therefore, NOSQL appears to handle the problem of unstructured data. Association rules mining is one of the popular techniques of data mining to extract hidden relationship from transactional databases. The algorithm for finding association dependencies is well-solved with Map Reduce. The goal of our work is to reduce the time of generating of frequent itemsets by using Map Reduce and NOSQL database oriented document. A comparative study is given to evaluate the performances of our algorithm with the classical algorithm Apriori. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Apriori" title="Apriori">Apriori</a>, <a href="https://publications.waset.org/abstracts/search?q=Association%20rules%20mining" title=" Association rules mining"> Association rules mining</a>, <a href="https://publications.waset.org/abstracts/search?q=Big%20Data" title=" Big Data"> Big Data</a>, <a href="https://publications.waset.org/abstracts/search?q=Data%20Mining" title=" Data Mining"> Data Mining</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadoop" title=" Hadoop"> Hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=MapReduce" title=" MapReduce"> MapReduce</a>, <a href="https://publications.waset.org/abstracts/search?q=MongoDB" title=" MongoDB"> MongoDB</a>, <a href="https://publications.waset.org/abstracts/search?q=NoSQL" title=" NoSQL"> NoSQL</a> </p> <a href="https://publications.waset.org/abstracts/126206/association-rules-mining-and-nosql-oriented-document-in-big-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/126206.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">168</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27204</span> Secure Multiparty Computations for Privacy Preserving Classifiers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Sumana">M. Sumana</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20S.%20Hareesha"> K. S. Hareesha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Secure computations are essential while performing privacy preserving data mining. Distributed privacy preserving data mining involve two to more sites that cannot pool in their data to a third party due to the violation of law regarding the individual. Hence in order to model the private data without compromising privacy and information loss, secure multiparty computations are used. Secure computations of product, mean, variance, dot product, sigmoid function using the additive and multiplicative homomorphic property is discussed. The computations are performed on vertically partitioned data with a single site holding the class value. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=homomorphic%20property" title="homomorphic property">homomorphic property</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20product" title=" secure product"> secure product</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20mean%20and%20variance" title=" secure mean and variance"> secure mean and variance</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20dot%20product" title=" secure dot product"> secure dot product</a>, <a href="https://publications.waset.org/abstracts/search?q=vertically%20partitioned%20data" title=" vertically partitioned data"> vertically partitioned data</a> </p> <a href="https://publications.waset.org/abstracts/34716/secure-multiparty-computations-for-privacy-preserving-classifiers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34716.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">417</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27203</span> Business Intelligence for Profiling of Telecommunication Customer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rokhmatul%20Insani">Rokhmatul Insani</a>, <a href="https://publications.waset.org/abstracts/search?q=Hira%20Laksmiwati%20Soemitro"> Hira Laksmiwati Soemitro</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Business Intelligence is a methodology that exploits the data to produce information and knowledge systematically, business intelligence can support the decision-making process. Some methods in business intelligence are data warehouse and data mining. A data warehouse can store historical data from transactional data. For data modelling in data warehouse, we apply dimensional modelling by Kimball. While data mining is used to extracting patterns from the data and get insight from the data. Data mining has many techniques, one of which is segmentation. For profiling of telecommunication customer, we use customer segmentation according to customer’s usage of services, customer invoice and customer payment. Customers can be grouped according to their characteristics and can be identified the profitable customers. We apply K-Means Clustering Algorithm for segmentation. The input variable for that algorithm we use RFM (Recency, Frequency and Monetary) model. All process in data mining, we use tools IBM SPSS modeller. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=business%20intelligence" title="business intelligence">business intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=customer%20segmentation" title=" customer segmentation"> customer segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20warehouse" title=" data warehouse"> data warehouse</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a> </p> <a href="https://publications.waset.org/abstracts/46969/business-intelligence-for-profiling-of-telecommunication-customer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46969.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">490</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27202</span> Indexing and Incremental Approach Using Map Reduce Bipartite Graph (MRBG) for Mining Evolving Big Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adarsh%20Shroff">Adarsh Shroff</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Big data is a collection of dataset so large and complex that it becomes difficult to process using data base management tools. To perform operations like search, analysis, visualization on big data by using data mining; which is the process of extraction of patterns or knowledge from large data set. In recent years, the data mining applications become stale and obsolete over time. Incremental processing is a promising approach to refreshing mining results. It utilizes previously saved states to avoid the expense of re-computation from scratch. This project uses i2MapReduce, an incremental processing extension to Map Reduce, the most widely used framework for mining big data. I2MapReduce performs key-value pair level incremental processing rather than task level re-computation, supports not only one-step computation but also more sophisticated iterative computation, which is widely used in data mining applications, and incorporates a set of novel techniques to reduce I/O overhead for accessing preserved fine-grain computation states. To optimize the mining results, evaluate i2MapReduce using a one-step algorithm and three iterative algorithms with diverse computation characteristics for efficient mining. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=map%20reduce" title=" map reduce"> map reduce</a>, <a href="https://publications.waset.org/abstracts/search?q=incremental%20processing" title=" incremental processing"> incremental processing</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20computation" title=" iterative computation"> iterative computation</a> </p> <a href="https://publications.waset.org/abstracts/46413/indexing-and-incremental-approach-using-map-reduce-bipartite-graph-mrbg-for-mining-evolving-big-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46413.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">357</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27201</span> A Review on Existing Challenges of Data Mining and Future Research Perspectives</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hema%20Bhardwaj">Hema Bhardwaj</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Srinivasa%20Rao"> D. Srinivasa Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Technology for analysing, processing, and extracting meaningful data from enormous and complicated datasets can be termed as "big data." The technique of big data mining and big data analysis is extremely helpful for business movements such as making decisions, building organisational plans, researching the market efficiently, improving sales, etc., because typical management tools cannot handle such complicated datasets. Special computational and statistical issues, such as measurement errors, noise accumulation, spurious correlation, and storage and scalability limitations, are brought on by big data. These unique problems call for new computational and statistical paradigms. This research paper offers an overview of the literature on big data mining, its process, along with problems and difficulties, with a focus on the unique characteristics of big data. Organizations have several difficulties when undertaking data mining, which has an impact on their decision-making. Every day, terabytes of data are produced, yet only around 1% of that data is really analyzed. The idea of the mining and analysis of data and knowledge discovery techniques that have recently been created with practical application systems is presented in this study. This article's conclusion also includes a list of issues and difficulties for further research in the area. The report discusses the management's main big data and data mining challenges. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20analysis" title=" data analysis"> data analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery%20techniques" title=" knowledge discovery techniques"> knowledge discovery techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining%20challenges" title=" data mining challenges"> data mining challenges</a> </p> <a href="https://publications.waset.org/abstracts/160836/a-review-on-existing-challenges-of-data-mining-and-future-research-perspectives" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160836.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">116</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27200</span> Review of Different Machine Learning Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Syed%20Romat%20Ali%20Shah">Syed Romat Ali Shah</a>, <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Shoaib"> Bilal Shoaib</a>, <a href="https://publications.waset.org/abstracts/search?q=Saleem%20Akhtar"> Saleem Akhtar</a>, <a href="https://publications.waset.org/abstracts/search?q=Munib%20Ahmad"> Munib Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahan%20Sadiqui"> Shahan Sadiqui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Classification is a data mining technique, which is recognizedon Machine Learning (ML) algorithm. It is used to classifythe individual articlein a knownofinformation into a set of predefinemodules or group. Web mining is also a portion of that sympathetic of data mining methods. The main purpose of this paper to analysis and compare the performance of Naïve Bayse Algorithm, Decision Tree, K-Nearest Neighbor (KNN), Artificial Neural Network (ANN)and Support Vector Machine (SVM). This paper consists of different ML algorithm and their advantages and disadvantages and also define research issues. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Data%20Mining" title="Data Mining">Data Mining</a>, <a href="https://publications.waset.org/abstracts/search?q=Web%20Mining" title=" Web Mining"> Web Mining</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=ML%20Algorithms" title=" ML Algorithms"> ML Algorithms</a> </p> <a href="https://publications.waset.org/abstracts/124105/review-of-different-machine-learning-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124105.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">307</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27199</span> Data Mining As A Tool For Knowledge Management: A Review </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maram%20Saleh">Maram Saleh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Knowledge has become an essential resource in today’s economy and become the most important asset of maintaining competition advantage in organizations. The importance of knowledge has made organizations to manage their knowledge assets and resources through all multiple knowledge management stages such as: Knowledge Creation, knowledge storage, knowledge sharing and knowledge use. Researches on data mining are continues growing over recent years on both business and educational fields. Data mining is one of the most important steps of the knowledge discovery in databases process aiming to extract implicit, unknown but useful knowledge and it is considered as significant subfield in knowledge management. Data miming have the great potential to help organizations to focus on extracting the most important information on their data warehouses. Data mining tools and techniques can predict future trends and behaviors, allowing businesses to make proactive, knowledge-driven decisions. This review paper explores the applications of data mining techniques in supporting knowledge management process as an effective knowledge discovery technique. In this paper, we identify the relationship between data mining and knowledge management, and then focus on introducing some application of date mining techniques in knowledge management for some real life domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Data%20Mining" title="Data Mining">Data Mining</a>, <a href="https://publications.waset.org/abstracts/search?q=Knowledge%20management" title=" Knowledge management"> Knowledge management</a>, <a href="https://publications.waset.org/abstracts/search?q=Knowledge%20discovery" title=" Knowledge discovery"> Knowledge discovery</a>, <a href="https://publications.waset.org/abstracts/search?q=Knowledge%20creation." title=" Knowledge creation."> Knowledge creation.</a> </p> <a href="https://publications.waset.org/abstracts/137030/data-mining-as-a-tool-for-knowledge-management-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/137030.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">214</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">27198</span> An Improved Parallel Algorithm of Decision Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jiameng%20Wang">Jiameng Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunfei%20Yin"> Yunfei Yin</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiyu%20Deng"> Xiyu Deng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Parallel optimization is one of the important research topics of data mining at this stage. Taking Classification and Regression Tree (CART) parallelization as an example, this paper proposes a parallel data mining algorithm based on SSP-OGini-PCCP. Aiming at the problem of choosing the best CART segmentation point, this paper designs an S-SP model without data association; and in order to calculate the Gini index efficiently, a parallel OGini calculation method is designed. In addition, in order to improve the efficiency of the pruning algorithm, a synchronous PCCP pruning strategy is proposed in this paper. In this paper, the optimal segmentation calculation, Gini index calculation, and pruning algorithm are studied in depth. These are important components of parallel data mining. By constructing a distributed cluster simulation system based on SPARK, data mining methods based on SSP-OGini-PCCP are tested. Experimental results show that this method can increase the search efficiency of the best segmentation point by an average of 89%, increase the search efficiency of the Gini segmentation index by 3853%, and increase the pruning efficiency by 146% on average; and as the size of the data set increases, the performance of the algorithm remains stable, which meets the requirements of contemporary massive data processing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=Gini%20index" title=" Gini index"> Gini index</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20data%20mining" title=" parallel data mining"> parallel data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=pruning%20ahead" title=" pruning ahead"> pruning ahead</a> </p> <a href="https://publications.waset.org/abstracts/119505/an-improved-parallel-algorithm-of-decision-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/119505.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">131</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=907">907</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=908">908</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2025 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>