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>    <title>Search results for: association rules</title> <meta name="description" content="Search results for: association rules"> <meta name="keywords" content="association rules"> <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="association rules" 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 2024/2025/2026">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="association rules"> <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> 3307</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: association rules</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3307</span> Semi-Automatic Method to Assist Expert for Association Rules Validation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amdouni%20Hamida">Amdouni Hamida</a>, <a href="https://publications.waset.org/abstracts/search?q=Gammoudi%20Mohamed%20Mohsen"> Gammoudi Mohamed Mohsen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to help the expert to validate association rules extracted from data, some quality measures are proposed in the literature. We distinguish two categories: objective and subjective measures. The first one depends on a fixed threshold and on data quality from which the rules are extracted. The second one consists on providing to the expert some tools in the objective to explore and visualize rules during the evaluation step. However, the number of extracted rules to validate remains high. Thus, the manually mining rules task is very hard. To solve this problem, we propose, in this paper, a semi-automatic method to assist the expert during the association rule's validation. Our method uses rule-based classification as follow: (i) We transform association rules into classification rules (classifiers), (ii) We use the generated classifiers for data classification. (iii) We visualize association rules with their quality classification to give an idea to the expert and to assist him during validation process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=rule-based%20classification" title=" rule-based classification"> rule-based classification</a>, <a href="https://publications.waset.org/abstracts/search?q=classification%20quality" title=" classification quality"> classification quality</a>, <a href="https://publications.waset.org/abstracts/search?q=validation" title=" validation"> validation</a> </p> <a href="https://publications.waset.org/abstracts/29443/semi-automatic-method-to-assist-expert-for-association-rules-validation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29443.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">439</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">3306</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">159</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">3305</span> A Method for Reduction of Association Rules in Data Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diego%20De%20Castro%20Rodrigues">Diego De Castro Rodrigues</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcelo%20Lisboa%20Rocha"> Marcelo Lisboa Rocha</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniela%20M.%20De%20Q.%20Trevisan"> Daniela M. De Q. Trevisan</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcos%20Dias%20Da%20Conceicao"> Marcos Dias Da Conceicao</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Rosa"> Gabriel Rosa</a>, <a href="https://publications.waset.org/abstracts/search?q=Rommel%20M.%20Barbosa"> Rommel M. Barbosa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of association rules algorithms within data mining is recognized as being of great value in the knowledge discovery in databases. Very often, the number of rules generated is high, sometimes even in databases with small volume, so the success in the analysis of results can be hampered by this quantity. The purpose of this research is to present a method for reducing the quantity of rules generated with association algorithms. Therefore, a computational algorithm was developed with the use of a Weka Application Programming Interface, which allows the execution of the method on different types of databases. After the development, tests were carried out on three types of databases: synthetic, model, and real. Efficient results were obtained in reducing the number of rules, where the worst case presented a gain of more than 50%, considering the concepts of support, confidence, and lift as measures. This study concluded that the proposed model is feasible and quite interesting, contributing to the analysis of the results of association rules generated from the use of algorithms. <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=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=rules%20reduction" title=" rules reduction"> rules reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a> </p> <a href="https://publications.waset.org/abstracts/110517/a-method-for-reduction-of-association-rules-in-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110517.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">160</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">3304</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">160</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">3303</span> The Parallelization of Algorithm Based on Partition Principle for Association Rules Discovery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khadidja%20Belbachir">Khadidja Belbachir</a>, <a href="https://publications.waset.org/abstracts/search?q=Hafida%20Belbachir"> Hafida Belbachir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> subsequently the expansion of the physical supports storage and the needs ceaseless to accumulate several data, the sequential algorithms of associations’ rules research proved to be ineffective. Thus the introduction of the new parallel versions is imperative. We propose in this paper, a parallel version of a sequential algorithm “Partition”. This last is fundamentally different from the other sequential algorithms, because it scans the data base only twice to generate the significant association rules. By consequence, the parallel approach does not require much communication between the sites. The proposed approach was implemented for an experimental study. The obtained results, shows a great reduction in execution time compared to the sequential version and Count Distributed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</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=partition" title=" partition"> partition</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20algorithms" title=" parallel algorithms"> parallel algorithms</a> </p> <a href="https://publications.waset.org/abstracts/34591/the-parallelization-of-algorithm-based-on-partition-principle-for-association-rules-discovery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34591.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">415</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">3302</span> Spatiotemporal Community Detection and Analysis of Associations among Overlapping Communities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=JooYoung%20Lee">JooYoung Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Rasheed%20Hussain"> Rasheed Hussain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Understanding the relationships among communities of users is the key to blueprint the evolution of human society. Majority of people are equipped with GPS devices, such as smart phones and smart cars, which can trace their whereabouts. In this paper, we discover communities of device users based on real locations in a given time frame. We, then, study the associations of discovered communities, referred to as temporal communities, and generate temporal and probabilistic association rules. The rules describe how strong communities are associated. By studying the generated rules, we can automatically extract underlying hierarchies of communities and permanent communities such as work places. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=community%20detection" title=" community detection"> community detection</a>, <a href="https://publications.waset.org/abstracts/search?q=evolution%20of%20communities" title=" evolution of communities"> evolution of communities</a>, <a href="https://publications.waset.org/abstracts/search?q=spatiotemporal" title=" spatiotemporal"> spatiotemporal</a> </p> <a href="https://publications.waset.org/abstracts/62840/spatiotemporal-community-detection-and-analysis-of-associations-among-overlapping-communities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62840.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">369</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">3301</span> An Approach for Association Rules Ranking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rihab%20Idoudi">Rihab Idoudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Saheb%20Ettabaa"> Karim Saheb Ettabaa</a>, <a href="https://publications.waset.org/abstracts/search?q=Basel%20Solaiman"> Basel Solaiman</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamel%20Hamrouni"> Kamel Hamrouni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Medical association rules induction is used to discover useful correlations between pertinent concepts from large medical databases. Nevertheless, ARs algorithms produce huge amount of delivered rules and do not guarantee the usefulness and interestingness of the generated knowledge. To overcome this drawback, we propose an ontology based interestingness measure for ARs ranking. According to domain expert, the goal of the use of ARs is to discover implicit relationships between items of different categories such as ‘clinical features and disorders’, ‘clinical features and radiological observations’, etc. That’s to say, the itemsets which are composed of ‘similar’ items are uninteresting. Therefore, the dissimilarity between the rule’s items can be used to judge the interestingness of association rules; the more different are the items, the more interesting the rule is. In this paper, we design a distinct approach for ranking semantically interesting association rules involving the use of an ontology knowledge mining approach. The basic idea is to organize the ontology’s concepts into a hierarchical structure of conceptual clusters of targeted subjects, where each cluster encapsulates ‘similar’ concepts suggesting a specific category of the domain knowledge. The interestingness of association rules is, then, defined as the dissimilarity between corresponding clusters. That is to say, the further are the clusters of the items in the AR, the more interesting the rule is. We apply the method in our domain of interest – mammographic domain- using an existing mammographic ontology called Mammo with the goal of deriving interesting rules from past experiences, to discover implicit relationships between concepts modeling the domain. <p class="card-text"><strong>Keywords:</strong> <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=conceptual%20clusters" title=" conceptual clusters"> conceptual clusters</a>, <a href="https://publications.waset.org/abstracts/search?q=interestingness%20measures" title=" interestingness measures"> interestingness measures</a>, <a href="https://publications.waset.org/abstracts/search?q=ontology%20knowledge%20mining" title=" ontology knowledge mining"> ontology knowledge mining</a>, <a href="https://publications.waset.org/abstracts/search?q=ranking" title=" ranking"> ranking</a> </p> <a href="https://publications.waset.org/abstracts/47971/an-approach-for-association-rules-ranking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47971.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">322</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">3300</span> An Optimized Association Rule Mining Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Archana%20Singh">Archana Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Jyoti%20Agarwal"> Jyoti Agarwal</a>, <a href="https://publications.waset.org/abstracts/search?q=Ajay%20Rana"> Ajay Rana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data Mining is an efficient technology to discover patterns in large databases. Association Rule Mining techniques are used to find the correlation between the various item sets in a database, and this co-relation between various item sets are used in decision making and pattern analysis. In recent years, the problem of finding association rules from large datasets has been proposed by many researchers. Various research papers on association rule mining (ARM) are studied and analyzed first to understand the existing algorithms. Apriori algorithm is the basic ARM algorithm, but it requires so many database scans. In DIC algorithm, less amount of database scan is needed but complex data structure lattice is used. The main focus of this paper is to propose a new optimized algorithm (Friendly Algorithm) and compare its performance with the existing algorithms A data set is used to find out frequent itemsets and association rules with the help of existing and proposed (Friendly Algorithm) and it has been observed that the proposed algorithm also finds all the frequent itemsets and essential association rules from databases as compared to existing algorithms in less amount of database scan. In the proposed algorithm, an optimized data structure is used i.e. Graph and Adjacency Matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</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=dynamic%20item%20set%20counting" title=" dynamic item set counting"> dynamic item set counting</a>, <a href="https://publications.waset.org/abstracts/search?q=FP-growth" title=" FP-growth"> FP-growth</a>, <a href="https://publications.waset.org/abstracts/search?q=friendly%20algorithm" title=" friendly algorithm"> friendly algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a> </p> <a href="https://publications.waset.org/abstracts/2437/an-optimized-association-rule-mining-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2437.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">420</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">3299</span> Analysis of Users’ Behavior on Book Loan Log Based on Association Rule Mining </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kanyarat%20Bussaban">Kanyarat Bussaban</a>, <a href="https://publications.waset.org/abstracts/search?q=Kunyanuth%20Kularbphettong"> Kunyanuth Kularbphettong </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research aims to create a model for analysis of student behavior using Library resources based on data mining technique in case of Suan Sunandha Rajabhat University. The model was created under association rules, apriori algorithm. The results were found 14 rules and the rules were tested with testing data set and it showed that the ability of classify data was 79.24 percent and the MSE was 22.91. The results showed that the user’s behavior model by using association rule technique can use to manage the library resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=behavior" title="behavior">behavior</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining%20technique" title=" data mining technique"> data mining technique</a>, <a href="https://publications.waset.org/abstracts/search?q=a%20priori%20algorithm" title=" a priori algorithm"> a priori algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery" title=" knowledge discovery"> knowledge discovery</a> </p> <a href="https://publications.waset.org/abstracts/2673/analysis-of-users-behavior-on-book-loan-log-based-on-association-rule-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2673.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">404</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">3298</span> Spatio-Temporal Data Mining with Association Rules for Lake Van</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tolga%20Aydin">Tolga Aydin</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Fatih%20Alaeddino%C4%9Flu"> M. Fatih Alaeddinoğlu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> People, throughout the history, have made estimates and inferences about the future by using their past experiences. Developing information technologies and the improvements in the database management systems make it possible to extract useful information from knowledge in hand for the strategic decisions. Therefore, different methods have been developed. Data mining by association rules learning is one of such methods. Apriori algorithm, one of the well-known association rules learning algorithms, is not commonly used in spatio-temporal data sets. However, it is possible to embed time and space features into the data sets and make Apriori algorithm a suitable data mining technique for learning spatio-temporal association rules. Lake Van, the largest lake of Turkey, is a closed basin. This feature causes the volume of the lake to increase or decrease as a result of change in water amount it holds. In this study, evaporation, humidity, lake altitude, amount of rainfall and temperature parameters recorded in Lake Van region throughout the years are used by the Apriori algorithm and a spatio-temporal data mining application is developed to identify overflows and newly-formed soil regions (underflows) occurring in the coastal parts of Lake Van. Identifying possible reasons of overflows and underflows may be used to alert the experts to take precautions and make the necessary investments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=apriori%20algorithm" title="apriori algorithm">apriori algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</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=spatio-temporal%20data" title=" spatio-temporal data"> spatio-temporal data</a> </p> <a href="https://publications.waset.org/abstracts/31190/spatio-temporal-data-mining-with-association-rules-for-lake-van" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31190.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">374</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">3297</span> Predicting Medical Check-Up Patient Re-Coming Using Sequential Pattern Mining and Association Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rizka%20Aisha%20Rahmi%20Hariadi">Rizka Aisha Rahmi Hariadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Chao%20Ou-Yang"> Chao Ou-Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Han-Cheng%20Wang"> Han-Cheng Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajesri%20Govindaraju"> Rajesri Govindaraju</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the increasing of medical check-up popularity, there are a huge number of medical check-up data stored in database and have not been useful. These data actually can be very useful for future strategic planning if we mine it correctly. In other side, a lot of patients come with unpredictable coming and also limited available facilities make medical check-up service offered by hospital not maximal. To solve that problem, this study used those medical check-up data to predict patient re-coming. Sequential pattern mining (SPM) and association rules method were chosen because these methods are suitable for predicting patient re-coming using sequential data. First, based on patient personal information the data was grouped into … groups then discriminant analysis was done to check significant of the grouping. Second, for each group some frequent patterns were generated using SPM method. Third, based on frequent patterns of each group, pairs of variable can be extracted using association rules to get general pattern of re-coming patient. Last, discussion and conclusion was done to give some implications of the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=patient%20re-coming" title="patient re-coming">patient re-coming</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20check-up" title=" medical check-up"> medical check-up</a>, <a href="https://publications.waset.org/abstracts/search?q=health%20examination" title=" health examination"> health examination</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=sequential%20pattern%20mining" title=" sequential pattern mining"> sequential pattern mining</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=discriminant%20analysis" title=" discriminant analysis"> discriminant analysis</a> </p> <a href="https://publications.waset.org/abstracts/27462/predicting-medical-check-up-patient-re-coming-using-sequential-pattern-mining-and-association-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27462.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">640</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">3296</span> An Efficient Data Mining Technique for Online Stores</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Al-Shalabi">Mohammed Al-Shalabi</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Obeidat"> Alaa Obeidat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In any food stores, some items will be expired or destroyed because the demand on these items is infrequent, so we need a system that can help the decision maker to make an offer on such items to improve the demand on the items by putting them with some other frequent item and decrease the price to avoid losses. The system generates hundreds or thousands of patterns (offers) for each low demand item, then it uses the association rules (support, confidence) to find the interesting patterns (the best offer to achieve the lowest losses). In this paper, we propose a data mining method for determining the best offer by merging the data mining techniques with the e-commerce strategy. The task is to build a model to predict the best offer. The goal is to maximize the profits of a store and avoid the loss of products. The idea in this paper is the using of the association rules in marketing with a combination with e-commerce. <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=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=confidence" title=" confidence"> confidence</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20stores" title=" online stores"> online stores</a> </p> <a href="https://publications.waset.org/abstracts/3171/an-efficient-data-mining-technique-for-online-stores" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3171.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">410</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">3295</span> A Hybrid Recommendation System Based on Association Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Mohammed%20Alsalama">Ahmed Mohammed Alsalama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recommendation systems are widely used in e-commerce applications. The engine of a current recommendation system recommends items to a particular user based on user preferences and previous high ratings. Various recommendation schemes such as collaborative filtering and content-based approaches are used to build a recommendation system. Most of the current recommendation systems were developed to fit a certain domain such as books, articles, and movies. We propose a hybrid framework recommendation system to be applied on two-dimensional spaces (User x Item) with a large number of Users and a small number of Items. Moreover, our proposed framework makes use of both favorite and non-favorite items of a particular user. The proposed framework is built upon the integration of association rules mining and the content-based approach. The results of experiments show that our proposed framework can provide accurate recommendations to users. <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=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=recommendation%20systems" title=" recommendation systems"> recommendation systems</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20systems" title=" hybrid systems"> hybrid systems</a> </p> <a href="https://publications.waset.org/abstracts/15279/a-hybrid-recommendation-system-based-on-association-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15279.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">453</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">3294</span> Clustering of Association Rules of ISIS & Al-Qaeda Based on Similarity Measures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tamanna%20Goyal">Tamanna Goyal</a>, <a href="https://publications.waset.org/abstracts/search?q=Divya%20Bansal"> Divya Bansal</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjeev%20Sofat"> Sanjeev Sofat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In world-threatening terrorist attacks, where early detection, distinction, and prediction are effective diagnosis techniques and for functionally accurate and precise analysis of terrorism data, there are so many data mining & statistical approaches to assure accuracy. The computational extraction of derived patterns is a non-trivial task which comprises specific domain discovery by means of sophisticated algorithm design and analysis. This paper proposes an approach for similarity extraction by obtaining the useful attributes from the available datasets of terrorist attacks and then applying feature selection technique based on the statistical impurity measures followed by clustering techniques on the basis of similarity measures. On the basis of degree of participation of attributes in the rules, the associative dependencies between the attacks are analyzed. Consequently, to compute the similarity among the discovered rules, we applied a weighted similarity measure. Finally, the rules are grouped by applying using hierarchical clustering. We have applied it to an open source dataset to determine the usability and efficiency of our technique, and a literature search is also accomplished to support the efficiency and accuracy of our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20measure" title=" similarity measure"> similarity measure</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20approaches" title=" statistical approaches "> statistical approaches </a> </p> <a href="https://publications.waset.org/abstracts/53364/clustering-of-association-rules-of-isis-al-qaeda-based-on-similarity-measures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53364.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">320</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">3293</span> On an Approach for Rule Generation in Association Rule Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Chandra">B. Chandra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Association Rule Mining, much attention has been paid for developing algorithms for large (frequent/closed/maximal) itemsets but very little attention has been paid to improve the performance of rule generation algorithms. Rule generation is an important part of Association Rule Mining. In this paper, a novel approach named NARG (Association Rule using Antecedent Support) has been proposed for rule generation that uses memory resident data structure named FCET (Frequent Closed Enumeration Tree) to find frequent/closed itemsets. In addition, the computational speed of NARG is enhanced by giving importance to the rules that have lower antecedent support. Comparative performance evaluation of NARG with fast association rule mining algorithm for rule generation has been done on synthetic datasets and real life datasets (taken from UCI Machine Learning Repository). Performance analysis shows that NARG is computationally faster in comparison to the existing algorithms for rule generation. <p class="card-text"><strong>Keywords:</strong> <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=association%20rule%20mining" title=" association rule mining"> association rule mining</a>, <a href="https://publications.waset.org/abstracts/search?q=antecedent%20support" title=" antecedent support"> antecedent support</a>, <a href="https://publications.waset.org/abstracts/search?q=rule%20generation" title=" rule generation"> rule generation</a> </p> <a href="https://publications.waset.org/abstracts/44331/on-an-approach-for-rule-generation-in-association-rule-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44331.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">324</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">3292</span> Statistical Analysis to Select Evacuation Route</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaky%20Musyarof">Zaky Musyarof</a>, <a href="https://publications.waset.org/abstracts/search?q=Dwi%20Yono%20Sutarto"> Dwi Yono Sutarto</a>, <a href="https://publications.waset.org/abstracts/search?q=Dwima%20Rindy%20Atika"> Dwima Rindy Atika</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20B.%20Fajriya%20Hakim"> R. B. Fajriya Hakim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Each country should be responsible for the safety of people, especially responsible for the safety of people living in disaster-prone areas. One of those services is provides evacuation route for them. But all this time, the selection of evacuation route is seem doesn’t well organized, it could be seen that when a disaster happen, there will be many accumulation of people on the steps of evacuation route. That condition is dangerous to people because hampers evacuation process. By some methods in Statistical analysis, author tries to give a suggestion how to prepare evacuation route which is organized and based on people habit. Those methods are association rules, sequential pattern mining, hierarchical cluster analysis and fuzzy logic. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern%20mining" title=" sequential pattern mining"> sequential pattern mining</a>, <a href="https://publications.waset.org/abstracts/search?q=cluster%20analysis" title=" cluster analysis"> cluster analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title=" fuzzy logic"> fuzzy logic</a>, <a href="https://publications.waset.org/abstracts/search?q=evacuation%20route" title=" evacuation route"> evacuation route</a> </p> <a href="https://publications.waset.org/abstracts/21873/statistical-analysis-to-select-evacuation-route" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21873.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">504</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">3291</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">393</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">3290</span> The Increasing Importance of CFC Rules: An OECD+ Country Overview</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Axel%20Prettl">Axel Prettl</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper provides an overview of the different CFC rule settings in the OECD and 22 additional countries for the years 2004 to 2014 and compares them. In order to do so, it gives a summary of law amendments for every country, provides a comparison and afterwards all CFC rules are rated in their ”power of anti-avoidance” over time. For that rating of CFC rules, the largest common denominator of rule characteristics is used to keep it as abstract as necessary and possible. The paper points out that the CFC rules in the considered countries are very different in their specifications and they reach from very strict to very low binding. All in all these rules get more and more common and important; more countries implement a CFC legislation and the strictness of most of them rises over time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CFC%20rules" title="CFC rules">CFC rules</a>, <a href="https://publications.waset.org/abstracts/search?q=international%20taxation" title=" international taxation"> international taxation</a>, <a href="https://publications.waset.org/abstracts/search?q=corporate%20taxation" title=" corporate taxation"> corporate taxation</a>, <a href="https://publications.waset.org/abstracts/search?q=country%20comparison" title=" country comparison"> country comparison</a> </p> <a href="https://publications.waset.org/abstracts/46197/the-increasing-importance-of-cfc-rules-an-oecd-country-overview" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46197.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">310</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">3289</span> Assessment on the Conduct of Arnis Competition in Pasuc National Olympics 2015: Basis for Improvement of Rules in Competition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paulo%20O.%20Motita">Paulo O. Motita</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Philippine Association of State Colleges and University (PASUC) is an association of State owned and operated higher learning institutions in the Philippines, it is the association that spearhead the conduct of the Annual National Athletic competitions for State Colleges and Universities and Arnis is one of the regular sports. In 2009, Republic Act 9850 also known as declared Arnis as the National Sports and Martial arts of the Philippines. Arnis an ancient Filipino Martial Arts is the major sports in the Annual Palarong Pambansa and other school based sports events. The researcher as a Filipino Martial Arts master and a former athlete desired to determine the extent of acceptability of the arnis rules in competition which serves as the basis for the development of arnis rules. The study aimed to assess the conduct of Arnis competition in PASUC Olympics 2015 in Tugegarao City, Cagayan, Philippines.the rules and conduct itself as perceived by Officiating officials, Coaches and Athletes during the competition last February 7-15, 2015. The descriptive method of research was used, the survey questionnaire as the data gathering instrument was validated. The respondents were composed of 12 Officiating officials, 19 coaches and 138 athletes representing the different regions. Their responses were treated using the Mean, Percentage and One-way Analysis of Variance. The study revealed that the conduct of Arnis competition in PASUC Olympics 2015 was at the low extent to moderate extent as perceived by the three groups of respondents in terms of officiating, scoring and giving violations. Furthermore there is no significant difference in the assessment of the three groups of respondents in the assessment of Anyo and Labanan. Considering the findings of the study, the following conclusions were drawn: 1). There is a need to identify the criteria for judging in Anyo and a tedious scrutiny on the rules of the game for labanan. 2) The three groups of respondents have similar views towards the assessment on the overall competitions for anyo that there were no clear technical guidelines for judging the performance of anyo event. 3). The three groups of respondents have similar views towards the assessment on the overall competitions for labanan that there were no clear technical guidelines for majority rule of giving scores in labanan. 4) The Anyo performance should be rated according to effectiveness of techniques and performance of weapon/s that are being used. 5) On other issues and concern towards the rules of competitions, labanan should be addressed in improving rules of competitions, focus on the applications of majority rules for scoring, players shall be given rest interval, a clear guidelines and set a standard qualifications for officiating officials. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PASUC%20Olympics%202015" title="PASUC Olympics 2015">PASUC Olympics 2015</a>, <a href="https://publications.waset.org/abstracts/search?q=Arnis%20rules%20of%20competition" title=" Arnis rules of competition"> Arnis rules of competition</a>, <a href="https://publications.waset.org/abstracts/search?q=Anyo" title=" Anyo"> Anyo</a>, <a href="https://publications.waset.org/abstracts/search?q=Labanan" title=" Labanan"> Labanan</a>, <a href="https://publications.waset.org/abstracts/search?q=officiating" title=" officiating"> officiating</a> </p> <a href="https://publications.waset.org/abstracts/28372/assessment-on-the-conduct-of-arnis-competition-in-pasuc-national-olympics-2015-basis-for-improvement-of-rules-in-competition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28372.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">458</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">3288</span> Semantic Indexing Improvement for Textual Documents: Contribution of Classification by Fuzzy Association Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Maraoui">Mohsen Maraoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the aim of natural language processing applications improvement, such as information retrieval, machine translation, lexical disambiguation, we focus on statistical approach to semantic indexing for multilingual text documents based on conceptual network formalism. We propose to use this formalism as an indexing language to represent the descriptive concepts and their weighting. These concepts represent the content of the document. Our contribution is based on two steps. In the first step, we propose the extraction of index terms using the multilingual lexical resource Euro WordNet (EWN). In the second step, we pass from the representation of index terms to the representation of index concepts through conceptual network formalism. This network is generated using the EWN resource and pass by a classification step based on association rules model (in attempt to discover the non-taxonomic relations or contextual relations between the concepts of a document). These relations are latent relations buried in the text and carried by the semantic context of the co-occurrence of concepts in the document. Our proposed indexing approach can be applied to text documents in various languages because it is based on a linguistic method adapted to the language through a multilingual thesaurus. Next, we apply the same statistical process regardless of the language in order to extract the significant concepts and their associated weights. We prove that the proposed indexing approach provides encouraging results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=concept%20extraction" title="concept extraction">concept extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=conceptual%20network%20formalism" title=" conceptual network formalism"> conceptual network formalism</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20association%20rules" title=" fuzzy association rules"> fuzzy association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=multilingual%20thesaurus" title=" multilingual thesaurus"> multilingual thesaurus</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20indexing" title=" semantic indexing"> semantic indexing</a> </p> <a href="https://publications.waset.org/abstracts/98854/semantic-indexing-improvement-for-textual-documents-contribution-of-classification-by-fuzzy-association-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98854.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">141</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">3287</span> Towards Learning Query Expansion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahlem%20Bouziri">Ahlem Bouziri</a>, <a href="https://publications.waset.org/abstracts/search?q=Chiraz%20Latiri"> Chiraz Latiri</a>, <a href="https://publications.waset.org/abstracts/search?q=Eric%20Gaussier"> Eric Gaussier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The steady growth in the size of textual document collections is a key progress-driver for modern information retrieval techniques whose effectiveness and efficiency are constantly challenged. Given a user query, the number of retrieved documents can be overwhelmingly large, hampering their efficient exploitation by the user. In addition, retaining only relevant documents in a query answer is of paramount importance for an effective meeting of the user needs. In this situation, the query expansion technique offers an interesting solution for obtaining a complete answer while preserving the quality of retained documents. This mainly relies on an accurate choice of the added terms to an initial query. Interestingly enough, query expansion takes advantage of large text volumes by extracting statistical information about index terms co-occurrences and using it to make user queries better fit the real information needs. In this respect, a promising track consists in the application of data mining methods to extract dependencies between terms, namely a generic basis of association rules between terms. The key feature of our approach is a better trade off between the size of the mining result and the conveyed knowledge. Thus, face to the huge number of derived association rules and in order to select the optimal combination of query terms from the generic basis, we propose to model the problem as a classification problem and solve it using a supervised learning algorithm such as SVM or k-means. For this purpose, we first generate a training set using a genetic algorithm based approach that explores the association rules space in order to find an optimal set of expansion terms, improving the MAP of the search results. The experiments were performed on SDA 95 collection, a data collection for information retrieval. It was found that the results were better in both terms of MAP and NDCG. The main observation is that the hybridization of text mining techniques and query expansion in an intelligent way allows us to incorporate the good features of all of them. As this is a preliminary attempt in this direction, there is a large scope for enhancing the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=supervised%20leaning" title="supervised leaning">supervised leaning</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20expansion" title=" query expansion"> query expansion</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</a> </p> <a href="https://publications.waset.org/abstracts/27524/towards-learning-query-expansion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27524.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">324</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">3286</span> Application of Association Rule Using Apriori Algorithm for Analysis of Industrial Accidents in 2013-2014 in Indonesia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Triano%20Nurhikmat">Triano Nurhikmat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Along with the progress of science and technology, the development of the industrialized world in Indonesia took place very rapidly. This leads to a process of industrialization of society Indonesia faster with the establishment of the company and the workplace are diverse. Development of the industry relates to the activity of the worker. Where in these work activities do not cover the possibility of an impending crash on either the workers or on a construction project. The cause of the occurrence of industrial accidents was the fault of electrical damage, work procedures, and error technique. The method of an association rule is one of the main techniques in data mining and is the most common form used in finding the patterns of data collection. In this research would like to know how relations of the association between the incidence of any industrial accidents. Therefore, by using methods of analysis association rule patterns associated with combination obtained two iterations item set (2 large item set) when every factor of industrial accidents with a West Jakarta so industrial accidents caused by the occurrence of an electrical value damage = 0.2 support and confidence value = 1, and the reverse pattern with value = 0.2 support and confidence = 0.75. <p class="card-text"><strong>Keywords:</strong> <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=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=industrial%20accidents" title=" industrial accidents"> industrial accidents</a>, <a href="https://publications.waset.org/abstracts/search?q=rules" title=" rules"> rules</a> </p> <a href="https://publications.waset.org/abstracts/68504/application-of-association-rule-using-apriori-algorithm-for-analysis-of-industrial-accidents-in-2013-2014-in-indonesia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68504.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">299</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">3285</span> The Trade Flow of Small Association Agreements When Rules of Origin Are Relaxed</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Esmat%20Kamel">Esmat Kamel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to shed light on the extent to which the Agadir Association agreement has fostered inter regional trade between the E.U_26 and the Agadir_4 countries; once that we control for the evolution of Agadir agreement’s exports to the rest of the world. The next valid question will be regarding any remarkable variation in the spatial/sectoral structure of exports, and to what extent has it been induced by the Agadir agreement itself and precisely after the adoption of rules of origin and the PANEURO diagonal cumulative scheme? The paper’s empirical dataset covering a timeframe from [2000 -2009] was designed to account for sector specific export and intermediate flows and the bilateral structured gravity model was custom tailored to capture sector and regime specific rules of origin and the Poisson Pseudo Maximum Likelihood Estimator was used to calculate the gravity equation. The methodological approach of this work is considered to be a threefold one which starts first by conducting a ‘Hierarchal Cluster Analysis’ to classify final export flows showing a certain degree of linkage between each other. The analysis resulted in three main sectoral clusters of exports between Agadir_4 and E.U_26: cluster 1 for Petrochemical related sectors, cluster 2 durable goods and finally cluster 3 for heavy duty machinery and spare parts sectors. Second step continues by taking export flows resulting from the 3 clusters to be subject to treatment with diagonal Rules of origin through ‘The Double Differences Approach’, versus an equally comparable untreated control group. Third step is to verify results through a robustness check applied by ‘Propensity Score Matching’ to validate that the same sectoral final export and intermediate flows increased when rules of origin were relaxed. Through all the previous analysis, a remarkable and partial significance of the interaction term combining both treatment effects and time for the coefficients of 13 out of the 17 covered sectors turned out to be partially significant and it further asserted that treatment with diagonal rules of origin contributed in increasing Agadir’s_4 final and intermediate exports to the E.U._26 on average by 335% and in changing Agadir_4 exports structure and composition to the E.U._26 countries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agadir%20association%20agreement" title="agadir association agreement">agadir association agreement</a>, <a href="https://publications.waset.org/abstracts/search?q=structured%20gravity%20model" title=" structured gravity model"> structured gravity model</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchal%20cluster%20analysis" title=" hierarchal cluster analysis"> hierarchal cluster analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20differences%20estimation" title=" double differences estimation"> double differences estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=propensity%20score%20matching" title=" propensity score matching"> propensity score matching</a>, <a href="https://publications.waset.org/abstracts/search?q=diagonal%20and%20relaxed%20rules%20of%20origin" title=" diagonal and relaxed rules of origin"> diagonal and relaxed rules of origin</a> </p> <a href="https://publications.waset.org/abstracts/61737/the-trade-flow-of-small-association-agreements-when-rules-of-origin-are-relaxed" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61737.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">318</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">3284</span> Affects Associations Analysis in Emergency Situations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joanna%20Grzybowska">Joanna Grzybowska</a>, <a href="https://publications.waset.org/abstracts/search?q=Magdalena%20Igras"> Magdalena Igras</a>, <a href="https://publications.waset.org/abstracts/search?q=Mariusz%20Zi%C3%B3%C5%82ko"> Mariusz Ziółko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Association rule learning is an approach for discovering interesting relationships in large databases. The analysis of relations, invisible at first glance, is a source of new knowledge which can be subsequently used for prediction. We used this data mining technique (which is an automatic and objective method) to learn about interesting affects associations in a corpus of emergency phone calls. We also made an attempt to match revealed rules with their possible situational context. The corpus was collected and subjectively annotated by two researchers. Each of 3306 recordings contains information on emotion: (1) type (sadness, weariness, anxiety, surprise, stress, anger, frustration, calm, relief, compassion, contentment, amusement, joy) (2) valence (negative, neutral, or positive) (3) intensity (low, typical, alternating, high). Also, additional information, that is a clue to speaker’s emotional state, was annotated: speech rate (slow, normal, fast), characteristic vocabulary (filled pauses, repeated words) and conversation style (normal, chaotic). Exponentially many rules can be extracted from a set of items (an item is a previously annotated single information). To generate the rules in the form of an implication X → Y (where X and Y are frequent k-itemsets) the Apriori algorithm was used - it avoids performing needless computations. Then, two basic measures (Support and Confidence) and several additional symmetric and asymmetric objective measures (e.g. Laplace, Conviction, Interest Factor, Cosine, correlation coefficient) were calculated for each rule. Each applied interestingness measure revealed different rules - we selected some top rules for each measure. Owing to the specificity of the corpus (emergency situations), most of the strong rules contain only negative emotions. There are though strong rules including neutral or even positive emotions. Three examples of the strongest rules are: {sadness} → {anxiety}; {sadness, weariness, stress, frustration} → {anger}; {compassion} → {sadness}. Association rule learning revealed the strongest configurations of affects (as well as configurations of affects with affect-related information) in our emergency phone calls corpus. The acquired knowledge can be used for prediction to fulfill the emotional profile of a new caller. Furthermore, a rule-related possible context analysis may be a clue to the situation a caller is in. <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=emergency%20phone%20calls" title=" emergency phone calls"> emergency phone calls</a>, <a href="https://publications.waset.org/abstracts/search?q=emotional%20profiles" title=" emotional profiles"> emotional profiles</a>, <a href="https://publications.waset.org/abstracts/search?q=rules" title=" rules"> rules</a> </p> <a href="https://publications.waset.org/abstracts/23164/affects-associations-analysis-in-emergency-situations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23164.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">408</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">3283</span> A Theoretical Model for Pattern Extraction in Large Datasets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Usman">Muhammad Usman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pattern extraction has been done in past to extract hidden and interesting patterns from large datasets. Recently, advancements are being made in these techniques by providing the ability of multi-level mining, effective dimension reduction, advanced evaluation and visualization support. This paper focuses on reviewing the current techniques in literature on the basis of these parameters. Literature review suggests that most of the techniques which provide multi-level mining and dimension reduction, do not handle mixed-type data during the process. Patterns are not extracted using advanced algorithms for large datasets. Moreover, the evaluation of patterns is not done using advanced measures which are suited for high-dimensional data. Techniques which provide visualization support are unable to handle a large number of rules in a small space. We present a theoretical model to handle these issues. The implementation of the model is beyond the scope of this paper. <p class="card-text"><strong>Keywords:</strong> <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=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20warehouses" title=" data warehouses"> data warehouses</a>, <a href="https://publications.waset.org/abstracts/search?q=visualization%20of%20association%20rules" title=" visualization of association rules"> visualization of association rules</a> </p> <a href="https://publications.waset.org/abstracts/80180/a-theoretical-model-for-pattern-extraction-in-large-datasets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80180.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">223</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">3282</span> Forecasting Unusual Infection of Patient Used by Irregular Weighted Point Set</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seema%20Vaidya">Seema Vaidya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mining association rule is a key issue in data mining. In any case, the standard models ignore the distinction among the exchanges, and the weighted association rule mining does not transform on databases with just binary attributes. This paper proposes a novel continuous example and executes a tree (FP-tree) structure, which is an increased prefix-tree structure for securing compacted, discriminating data about examples, and makes a fit FP-tree-based mining system, FP enhanced capacity algorithm is used, for mining the complete game plan of examples by illustration incessant development. Here, this paper handles the motivation behind making remarkable and weighted item sets, i.e. rare weighted item set mining issue. The two novel brightness measures are proposed for figuring the infrequent weighted item set mining issue. Also, the algorithm are handled which perform IWI which is more insignificant IWI mining. Moreover we utilized the rare item set for choice based structure. The general issue of the start of reliable definite rules is troublesome for the grounds that hypothetically no inciting technique with no other person can promise the rightness of influenced theories. In this way, this framework expects the disorder with the uncommon signs. Usage study demonstrates that proposed algorithm upgrades the structure which is successful and versatile for mining both long and short diagnostics rules. Structure upgrades aftereffects of foreseeing rare diseases of patient. <p class="card-text"><strong>Keywords:</strong> <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=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=IWI%20mining" title=" IWI mining"> IWI mining</a>, <a href="https://publications.waset.org/abstracts/search?q=infrequent%20item%20set" title=" infrequent item set"> infrequent item set</a>, <a href="https://publications.waset.org/abstracts/search?q=frequent%20pattern%20growth" title=" frequent pattern growth"> frequent pattern growth</a> </p> <a href="https://publications.waset.org/abstracts/32862/forecasting-unusual-infection-of-patient-used-by-irregular-weighted-point-set" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32862.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">399</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">3281</span> Assessing Supply Chain Performance through Data Mining Techniques: A Case of Automotive Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emin%20Gundogar">Emin Gundogar</a>, <a href="https://publications.waset.org/abstracts/search?q=Burak%20Erkayman"> Burak Erkayman</a>, <a href="https://publications.waset.org/abstracts/search?q=Nusret%20Sazak"> Nusret Sazak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Providing effective management performance through the whole supply chain is critical issue and hard to applicate. The proper evaluation of integrated data may conclude with accurate information. Analysing the supply chain data through OLAP (On-Line Analytical Processing) technologies may provide multi-angle view of the work and consolidation. In this study, association rules and classification techniques are applied to measure the supply chain performance metrics of an automotive manufacturer in Turkey. Main criteria and important rules are determined. The comparison of the results of the algorithms is presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20performance" title="supply chain performance">supply chain performance</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20measurement" title=" performance measurement"> performance measurement</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=automotive" title=" automotive"> automotive</a> </p> <a href="https://publications.waset.org/abstracts/9196/assessing-supply-chain-performance-through-data-mining-techniques-a-case-of-automotive-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9196.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">513</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">3280</span> Study and Acquisition of the Duality of the Arabic Language</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Oleg%20Redkin">Oleg Redkin</a>, <a href="https://publications.waset.org/abstracts/search?q=Olga%20Bernikova"> Olga Bernikova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is commonly accepted that every language is both pure linguistic phenomenon as well as socially significant communicative system, which exists on the basis of certain society - its collective 'native speaker'. Therefore the language evolution and features besides its own linguistic rules and regulations are also defined by the influence of a number of extra-linguistic factors. The above mentioned statement may be illustrated by the example of the Arabic language which may be characterized by the following peculiarities: - the inner logic of the Arabic language - the 'algebraicity' of its morphological paradigms and grammar rules; - association of the Arabic language with the sacred texts of Islam, its close ties with the pre-Islamic and Islamic cultural heritage - the pre-Islamic poetry and Islamic literature and science; - territorial distribution, which in recent years went far beyond the boundaries of its traditional realm due to the development of new technologies and the spread of mass media, and what is more important, migration processes; - association of the Arabic language with the so called 'Renaissance of Islam'. These peculiarities should be remembered while considering the status of the Modern Standard Arabic (MSA) language or the Classical Arabic (CA) language as well as the Modern Arabic (MA) dialects in synchrony or from the diachronic point of view. Continuity of any system in diachrony on the one hand depends on the level of its ability to adapt itself to changing environment and by its internal ties on the other. Structural durability of language is characterized by its inner logic, hierarchy of paradigms and its grammar rules, as well as continuity of their implementation in acts of everyday communication. Since the Arabic language is both linguistic and social phenomenon the process of the Arabic language acquisition and study should not be focused only on the knowledge about linguistic features or development of communicative skills alone, but must be supplied with the information related to culture, history and religion of peoples of certain region that will expand and enrich competences of the target audience. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arabic" title="Arabic">Arabic</a>, <a href="https://publications.waset.org/abstracts/search?q=culture" title=" culture"> culture</a>, <a href="https://publications.waset.org/abstracts/search?q=Islam" title=" Islam"> Islam</a>, <a href="https://publications.waset.org/abstracts/search?q=language" title=" language"> language</a> </p> <a href="https://publications.waset.org/abstracts/77301/study-and-acquisition-of-the-duality-of-the-arabic-language" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77301.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">276</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">3279</span> The Effectiveness of National Fiscal Rules in the Asia-Pacific Countries</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chiung-Ju%20Huang">Chiung-Ju Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan-Hong%20Ho"> Yuan-Hong Ho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study utilizes the International Monetary Fund (IMF) Fiscal Rules Dataset focusing on four specific fiscal rules such as expenditure rule, revenue rule, budget balance rule, and debt rule and five main characteristics of each fiscal rule those are monitoring, enforcement, coverage, legal basis, and escape clause to construct the Fiscal Rule Index for nine countries in the Asia-Pacific region from 1996 to 2015. After constructing the fiscal rule index for each country, we utilize the Panel Generalized Method of Moments (Panel GMM) by using the constructed fiscal rule index to examine the effectiveness of fiscal rules in reducing procyclicality. Empirical results show that national fiscal rules have a significantly negative impact on procyclicality of government expenditure. Additionally, stricter fiscal rules combined with high government effectiveness are effective in reducing procyclicality of government expenditure. Results of this study indicate that for nine Asia-Pacific countries, policymakers’ use of fiscal rules and government effectiveness to reducing procyclicality of fiscal policy are effective. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=counter-cyclical%20policy" title="counter-cyclical policy">counter-cyclical policy</a>, <a href="https://publications.waset.org/abstracts/search?q=fiscal%20rules" title=" fiscal rules"> fiscal rules</a>, <a href="https://publications.waset.org/abstracts/search?q=government%20efficiency" title=" government efficiency"> government efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=procyclical%20policy" title=" procyclical policy"> procyclical policy</a> </p> <a href="https://publications.waset.org/abstracts/95982/the-effectiveness-of-national-fiscal-rules-in-the-asia-pacific-countries" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95982.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">280</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">3278</span> Analysis of the Simulation Merger and Economic Benefit of Local Farmers' Associations in Taiwan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lu%20Yung-Hsiang">Lu Yung-Hsiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang%20Kuming"> Chang Kuming</a>, <a href="https://publications.waset.org/abstracts/search?q=Dai%20Yi-Fang"> Dai Yi-Fang</a>, <a href="https://publications.waset.org/abstracts/search?q=Liao%20Ching-Yi"> Liao Ching-Yi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to Taiwan’s administrative division of future land planning may lead farmer association and service areas facing recombination or merger. Thus, merger combination and the economic benefit of the farmer association are worth to be discussed. The farmer association in the merger, which may cause some then will not be consolidated, or consolidate two, or ever more to one association. However, under what condition to merge is greatest, as one of observation of this study. In addition, research without using simulation methods and only on the credit department rather whole farmer association. Therefore, this paper will use the simulation approach, and examine both the merge of farmer association and the condition under which the benefits are the greatest. The data of this study set include 266 farmer associations in Taiwan period 2012 to 2013. Empirical results showed that the number of the farmer association optimal simulation combination is 108.After the merger from the first stage can be reduced by 60% of the farmers’ association. The cost saving effects of the post-merger is not different. The cost efficiency of the farmers’ association improved it. The economies of scale and scope would decrease by the merger. The research paper hopes the finding will benefit the future merger of the farmers’ association. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=simulation%20merger" title="simulation merger">simulation merger</a>, <a href="https://publications.waset.org/abstracts/search?q=farmer%20association" title=" farmer association"> farmer association</a>, <a href="https://publications.waset.org/abstracts/search?q=assurance%20region" title=" assurance region"> assurance region</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20envelopment%20analysis" title=" data envelopment analysis"> data envelopment analysis</a> </p> <a href="https://publications.waset.org/abstracts/42991/analysis-of-the-simulation-merger-and-economic-benefit-of-local-farmers-associations-in-taiwan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42991.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">350</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=association%20rules&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&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=association%20rules&page=110">110</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&page=111">111</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=association%20rules&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">© 2024 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>