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: hierarchical filtering</title> <meta name="description" content="Search results for: hierarchical filtering"> <meta name="keywords" content="hierarchical filtering"> <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="hierarchical filtering" 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="hierarchical filtering"> <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> 919</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: hierarchical filtering</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">919</span> Hierarchical Filtering Method of Threat Alerts Based on Correlation Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xudong%20He">Xudong He</a>, <a href="https://publications.waset.org/abstracts/search?q=Jian%20Wang"> Jian Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiqiang%20Liu"> Jiqiang Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Lei%20Han"> Lei Han</a>, <a href="https://publications.waset.org/abstracts/search?q=Yang%20Yu"> Yang Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shaohua%20Lv"> Shaohua Lv</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, the threats of the internet are enormous and increasing; however, the classification of huge alert messages generated in this environment is relatively monotonous. It affects the accuracy of the network situation assessment, and also brings inconvenience to the security managers to deal with the emergency. In order to deal with potential network threats effectively and provide more effective data to improve the network situation awareness. It is essential to build a hierarchical filtering method to prevent the threats. In this paper, it establishes a model for data monitoring, which can filter systematically from the original data to get the grade of threats and be stored for using again. Firstly, it filters the vulnerable resources, open ports of host devices and services. Then use the entropy theory to calculate the performance changes of the host devices at the time of the threat occurring and filter again. At last, sort the changes of the performance value at the time of threat occurring. Use the alerts and performance data collected in the real network environment to evaluate and analyze. The comparative experimental analysis shows that the threat filtering method can effectively filter the threat alerts effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlation%20analysis" title="correlation analysis">correlation analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering" title=" hierarchical filtering"> hierarchical filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=multisource%20data" title=" multisource data"> multisource data</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a> </p> <a href="https://publications.waset.org/abstracts/88123/hierarchical-filtering-method-of-threat-alerts-based-on-correlation-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88123.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">201</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">918</span> Additive White Gaussian Noise Filtering from ECG by Wiener Filter and Median Filter: A Comparative Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Javidnia">Hossein Javidnia</a>, <a href="https://publications.waset.org/abstracts/search?q=Salehe%20Taheri"> Salehe Taheri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Electrocardiogram (ECG) is the recording of the heart’s electrical potential versus time. ECG signals are often contaminated with noise such as baseline wander and muscle noise. As these signals have been widely used in clinical studies to detect heart diseases, it is essential to filter these noises. In this paper we compare performance of Wiener Filtering and Median Filtering methods to filter Additive White Gaussian (AWG) noise with the determined signal to noise ratio (SNR) ranging from 3 to 5 dB applied to long-term ECG recordings samples. Root mean square error (RMSE) and coefficient of determination (R2) between the filtered ECG and original ECG was used as the filter performance indicator. Experimental results show that Wiener filter has better noise filtering performance than Median filter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ECG%20noise%20filtering" title="ECG noise filtering">ECG noise filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=Wiener%20filtering" title=" Wiener filtering"> Wiener filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=median%20filtering" title=" median filtering"> median filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20noise" title=" Gaussian noise"> Gaussian noise</a>, <a href="https://publications.waset.org/abstracts/search?q=filtering%20performance" title=" filtering performance"> filtering performance</a> </p> <a href="https://publications.waset.org/abstracts/9623/additive-white-gaussian-noise-filtering-from-ecg-by-wiener-filter-and-median-filter-a-comparative-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9623.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">529</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">917</span> Meta-Learning for Hierarchical Classification and Applications in Bioinformatics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fabio%20Fabris">Fabio Fabris</a>, <a href="https://publications.waset.org/abstracts/search?q=Alex%20A.%20Freitas"> Alex A. Freitas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hierarchical classification is a special type of classification task where the class labels are organised into a hierarchy, with more generic class labels being ancestors of more specific ones. Meta-learning for classification-algorithm recommendation consists of recommending to the user a classification algorithm, from a pool of candidate algorithms, for a dataset, based on the past performance of the candidate algorithms in other datasets. Meta-learning is normally used in conventional, non-hierarchical classification. By contrast, this paper proposes a meta-learning approach for more challenging task of hierarchical classification, and evaluates it in a large number of bioinformatics datasets. Hierarchical classification is especially relevant for bioinformatics problems, as protein and gene functions tend to be organised into a hierarchy of class labels. This work proposes meta-learning approach for recommending the best hierarchical classification algorithm to a hierarchical classification dataset. This work’s contributions are: 1) proposing an algorithm for splitting hierarchical datasets into new datasets to increase the number of meta-instances, 2) proposing meta-features for hierarchical classification, and 3) interpreting decision-tree meta-models for hierarchical classification algorithm recommendation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithm%20recommendation" title="algorithm recommendation">algorithm recommendation</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-learning" title=" meta-learning"> meta-learning</a>, <a href="https://publications.waset.org/abstracts/search?q=bioinformatics" title=" bioinformatics"> bioinformatics</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20classification" title=" hierarchical classification"> hierarchical classification</a> </p> <a href="https://publications.waset.org/abstracts/81005/meta-learning-for-hierarchical-classification-and-applications-in-bioinformatics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81005.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">314</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">916</span> Identification of Spam Keywords Using Hierarchical Category in C2C E-Commerce</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shao%20Bo%20Cheng">Shao Bo Cheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Jin%20Han"> Yong-Jin Han</a>, <a href="https://publications.waset.org/abstracts/search?q=Se%20Young%20Park"> Se Young Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Seong-Bae%20Park"> Seong-Bae Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Consumer-to-Consumer (C2C) E-commerce has been growing at a very high speed in recent years. Since identical or nearly-same kinds of products compete one another by relying on keyword search in C2C E-commerce, some sellers describe their products with spam keywords that are popular but are not related to their products. Though such products get more chances to be retrieved and selected by consumers than those without spam keywords, the spam keywords mislead the consumers and waste their time. This problem has been reported in many commercial services like e-bay and taobao, but there have been little research to solve this problem. As a solution to this problem, this paper proposes a method to classify whether keywords of a product are spam or not. The proposed method assumes that a keyword for a given product is more reliable if the keyword is observed commonly in specifications of products which are the same or the same kind as the given product. This is because that a hierarchical category of a product in general determined precisely by a seller of the product and so is the specification of the product. Since higher layers of the hierarchical category represent more general kinds of products, a reliable degree is differently determined according to the layers. Hence, reliable degrees from different layers of a hierarchical category become features for keywords and they are used together with features only from specifications for classification of the keywords. Support Vector Machines are adopted as a basic classifier using the features, since it is powerful, and widely used in many classification tasks. In the experiments, the proposed method is evaluated with a golden standard dataset from Yi-han-wang, a Chinese C2C e-commerce, and is compared with a baseline method that does not consider the hierarchical category. The experimental results show that the proposed method outperforms the baseline in F1-measure, which proves that spam keywords are effectively identified by a hierarchical category in C2C e-commerce. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spam%20keyword" title="spam keyword">spam keyword</a>, <a href="https://publications.waset.org/abstracts/search?q=e-commerce" title=" e-commerce"> e-commerce</a>, <a href="https://publications.waset.org/abstracts/search?q=keyword%20features" title=" keyword features"> keyword features</a>, <a href="https://publications.waset.org/abstracts/search?q=spam%20%EF%AC%81ltering" title=" spam ﬁltering"> spam ﬁltering</a> </p> <a href="https://publications.waset.org/abstracts/15501/identification-of-spam-keywords-using-hierarchical-category-in-c2c-e-commerce" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15501.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">294</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">915</span> Hybrid Hierarchical Clustering Approach for Community Detection in Social Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Radhia%20Toujani">Radhia Toujani</a>, <a href="https://publications.waset.org/abstracts/search?q=Jalel%20Akaichi"> Jalel Akaichi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Social Networks generally present a hierarchy of communities. To determine these communities and the relationship between them, detection algorithms should be applied. Most of the existing algorithms, proposed for hierarchical communities identification, are based on either agglomerative clustering or divisive clustering. In this paper, we present a hybrid hierarchical clustering approach for community detection based on both bottom-up and bottom-down clustering. Obviously, our approach provides more relevant community structure than hierarchical method which considers only divisive or agglomerative clustering to identify communities. Moreover, we performed some comparative experiments to enhance the quality of the clustering results and to show the effectiveness of our algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title="agglomerative hierarchical clustering">agglomerative hierarchical clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=community%20structure" title=" community structure"> community structure</a>, <a href="https://publications.waset.org/abstracts/search?q=divisive%20hierarchical%20clustering" title=" divisive hierarchical clustering"> divisive hierarchical clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20hierarchical%20clustering" title=" hybrid hierarchical clustering"> hybrid hierarchical clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=opinion%20mining" title=" opinion mining"> opinion mining</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20network" title=" social network"> social network</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20network%20analysis" title=" social network analysis"> social network analysis</a> </p> <a href="https://publications.waset.org/abstracts/63702/hybrid-hierarchical-clustering-approach-for-community-detection-in-social-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63702.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">365</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">914</span> Image Enhancement Algorithm of Photoacoustic Tomography Using Active Contour Filtering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Prasannakumar%20Palaniappan">Prasannakumar Palaniappan</a>, <a href="https://publications.waset.org/abstracts/search?q=Dong%20Ho%20Shin"> Dong Ho Shin</a>, <a href="https://publications.waset.org/abstracts/search?q=Chul%20Gyu%20Song"> Chul Gyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The photoacoustic images are obtained from a custom developed linear array photoacoustic tomography system. The biological specimens are imitated by conducting phantom tests in order to retrieve a fully functional photoacoustic image. The acquired image undergoes the active region based contour filtering to remove the noise and accurately segment the object area for further processing. The universal back projection method is used as the image reconstruction algorithm. The active contour filtering is analyzed by evaluating the signal to noise ratio and comparing it with the other filtering methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contour%20filtering" title="contour filtering">contour filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20array" title=" linear array"> linear array</a>, <a href="https://publications.waset.org/abstracts/search?q=photoacoustic%20tomography" title=" photoacoustic tomography"> photoacoustic tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=universal%20back%20projection" title=" universal back projection"> universal back projection</a> </p> <a href="https://publications.waset.org/abstracts/40626/image-enhancement-algorithm-of-photoacoustic-tomography-using-active-contour-filtering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40626.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">400</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">913</span> Hierarchical Clustering Algorithms in Data Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Z.%20Abdullah">Z. Abdullah</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20R.%20Hamdan"> A. R. Hamdan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Clustering is a process of grouping objects and data into groups of clusters to ensure that data objects from the same cluster are identical to each other. Clustering algorithms in one of the areas in data mining and it can be classified into partition, hierarchical, density based, and grid-based. Therefore, in this paper, we do a survey and review for four major hierarchical clustering algorithms called CURE, ROCK, CHAMELEON, and BIRCH. The obtained state of the art of these algorithms will help in eliminating the current problems, as well as deriving more robust and scalable algorithms for clustering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clustering" title="clustering">clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=unsupervised%20learning" title=" unsupervised learning"> unsupervised learning</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithms" title=" algorithms"> algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical" title=" hierarchical"> hierarchical</a> </p> <a href="https://publications.waset.org/abstracts/31217/hierarchical-clustering-algorithms-in-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31217.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">885</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">912</span> Real-Time Visualization Using GPU-Accelerated Filtering of LiDAR Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sa%C5%A1o%20Pe%C4%8Dnik">Sašo Pečnik</a>, <a href="https://publications.waset.org/abstracts/search?q=Borut%20%C5%BDalik"> Borut Žalik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a real-time visualization technique and filtering of classified LiDAR point clouds. The visualization is capable of displaying filtered information organized in layers by the classification attribute saved within LiDAR data sets. We explain the used data structure and data management, which enables real-time presentation of layered LiDAR data. Real-time visualization is achieved with LOD optimization based on the distance from the observer without loss of quality. The filtering process is done in two steps and is entirely executed on the GPU and implemented using programmable shaders. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=filtering" title="filtering">filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=graphics" title=" graphics"> graphics</a>, <a href="https://publications.waset.org/abstracts/search?q=level-of-details" title=" level-of-details"> level-of-details</a>, <a href="https://publications.waset.org/abstracts/search?q=LiDAR" title=" LiDAR"> LiDAR</a>, <a href="https://publications.waset.org/abstracts/search?q=real-time%20visualization" title=" real-time visualization"> real-time visualization</a> </p> <a href="https://publications.waset.org/abstracts/16857/real-time-visualization-using-gpu-accelerated-filtering-of-lidar-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16857.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">308</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">911</span> 3D Guided Image Filtering to Improve Quality of Short-Time Binned Dynamic PET Images Using MRI Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tabassum%20Husain">Tabassum Husain</a>, <a href="https://publications.waset.org/abstracts/search?q=Shen%20Peng%20Li"> Shen Peng Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhaolin%20Chen"> Zhaolin Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper evaluates the usability of 3D Guided Image Filtering to enhance the quality of short-time binned dynamic PET images by using MRI images. Guided image filtering is an edge-preserving filter proposed to enhance 2D images. The 3D filter is applied on 1 and 5-minute binned images. The results are compared with 15-minute binned images and the Gaussian filtering. The guided image filter enhances the quality of dynamic PET images while also preserving important information of the voxels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20PET%20images" title="dynamic PET images">dynamic PET images</a>, <a href="https://publications.waset.org/abstracts/search?q=guided%20image%20filter" title=" guided image filter"> guided image filter</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20enhancement" title=" image enhancement"> image enhancement</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20preservation%20filtering" title=" information preservation filtering"> information preservation filtering</a> </p> <a href="https://publications.waset.org/abstracts/152864/3d-guided-image-filtering-to-improve-quality-of-short-time-binned-dynamic-pet-images-using-mri-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152864.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">132</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">910</span> The Evaluation of the Performance of Different Filtering Approaches in Tracking Problem and the Effect of Noise Variance </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Javad%20Mollakazemi">Mohammad Javad Mollakazemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Farhad%20Asadi"> Farhad Asadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Aref%20Ghafouri"> Aref Ghafouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Performance of different filtering approaches depends on modeling of dynamical system and algorithm structure. For modeling and smoothing the data the evaluation of posterior distribution in different filtering approach should be chosen carefully. In this paper different filtering approaches like filter KALMAN, EKF, UKF, EKS and smoother RTS is simulated in some trajectory tracking of path and accuracy and limitation of these approaches are explained. Then probability of model with different filters is compered and finally the effect of the noise variance to estimation is described with simulations results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20approximation" title="Gaussian approximation">Gaussian approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalman%20smoother" title=" Kalman smoother"> Kalman smoother</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20estimation" title=" parameter estimation"> parameter estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=noise%20variance" title=" noise variance"> noise variance</a> </p> <a href="https://publications.waset.org/abstracts/14553/the-evaluation-of-the-performance-of-different-filtering-approaches-in-tracking-problem-and-the-effect-of-noise-variance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14553.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">909</span> Knowledge Discovery from Production Databases for Hierarchical Process Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pavol%20Tanuska">Pavol Tanuska</a>, <a href="https://publications.waset.org/abstracts/search?q=Pavel%20Vazan"> Pavel Vazan</a>, <a href="https://publications.waset.org/abstracts/search?q=Michal%20Kebisek"> Michal Kebisek</a>, <a href="https://publications.waset.org/abstracts/search?q=Dominika%20Jurovata"> Dominika Jurovata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper gives the results of the project that was oriented on the usage of knowledge discoveries from production systems for needs of the hierarchical process control. One of the main project goals was the proposal of knowledge discovery model for process control. Specifics data mining methods and techniques was used for defined problems of the process control. The gained knowledge was used on the real production system, thus, the proposed solution has been verified. The paper documents how it is possible to apply new discovery knowledge to be used in the real hierarchical process control. There are specified the opportunities for application of the proposed knowledge discovery model for hierarchical process control. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20process%20control" title="hierarchical process control">hierarchical process control</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery%20from%20databases" title=" knowledge discovery from databases"> knowledge discovery from databases</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20control" title=" process control"> process control</a> </p> <a href="https://publications.waset.org/abstracts/2816/knowledge-discovery-from-production-databases-for-hierarchical-process-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2816.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">481</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">908</span> Application of Artificial Immune Systems Combined with Collaborative Filtering in Movie Recommendation System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pei-Chann%20Chang">Pei-Chann Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jhen-Fu%20Liao"> Jhen-Fu Liao</a>, <a href="https://publications.waset.org/abstracts/search?q=Chin-Hung%20Teng"> Chin-Hung Teng</a>, <a href="https://publications.waset.org/abstracts/search?q=Meng-Hui%20Chen"> Meng-Hui Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research combines artificial immune system with user and item based collaborative filtering to create an efficient and accurate recommendation system. By applying the characteristic of antibodies and antigens in the artificial immune system and using Pearson correlation coefficient as the affinity threshold to cluster the data, our collaborative filtering can effectively find useful users and items for rating prediction. This research uses MovieLens dataset as our testing target to evaluate the effectiveness of the algorithm developed in this study. The experimental results show that the algorithm can effectively and accurately predict the movie ratings. Compared to some state of the art collaborative filtering systems, our system outperforms them in terms of the mean absolute error on the MovieLens dataset. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20immune%20system" title="artificial immune system">artificial immune system</a>, <a href="https://publications.waset.org/abstracts/search?q=collaborative%20filtering" title=" collaborative filtering"> collaborative filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=recommendation%20system" title=" recommendation system"> recommendation system</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity" title=" similarity"> similarity</a> </p> <a href="https://publications.waset.org/abstracts/5057/application-of-artificial-immune-systems-combined-with-collaborative-filtering-in-movie-recommendation-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5057.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">535</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">907</span> Speed up Vector Median Filtering by Quasi Euclidean Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vinai%20K.%20Singh">Vinai K. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For reducing impulsive noise without degrading image contours, median filtering is a powerful tool. In multiband images as for example colour images or vector fields obtained by optic flow computation, a vector median filter can be used. Vector median filters are defined on the basis of a suitable distance, the best performing distance being the Euclidean. Euclidean distance is evaluated by using the Euclidean norms which is quite demanding from the point of view of computation given that a square root is required. In this paper an optimal piece-wise linear approximation of the Euclidean norm is presented which is applied to vector median filtering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=euclidean%20norm" title="euclidean norm">euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi%20euclidean%20norm" title=" quasi euclidean norm"> quasi euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20median%20filtering" title=" vector median filtering"> vector median filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=applied%20mathematics" title=" applied mathematics"> applied mathematics</a> </p> <a href="https://publications.waset.org/abstracts/21942/speed-up-vector-median-filtering-by-quasi-euclidean-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21942.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">474</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">906</span> Why Do We Need Hierachical Linear Models?</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Ayd%C4%B1n">Mustafa Aydın</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Murat%20Sunbul"> Ali Murat Sunbul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hierarchical or nested data structures usually are seen in many research areas. Especially, in the field of education, if we examine most of the studies, we can see the nested structures. Students in classes, classes in schools, schools in cities and cities in regions are similar nested structures. In a hierarchical structure, students being in the same class, sharing the same physical conditions and similar experiences and learning from the same teachers, they demonstrate similar behaviors between them rather than the students in other classes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20linear%20modeling" title="hierarchical linear modeling">hierarchical linear modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=nested%20data" title=" nested data"> nested data</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20structure" title="hierarchical structure">hierarchical structure</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20structure" title=" data structure "> data structure </a> </p> <a href="https://publications.waset.org/abstracts/2470/why-do-we-need-hierachical-linear-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2470.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">652</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">905</span> Building and Tree Detection Using Multiscale Matched Filtering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20H.%20%C3%96zcan">Abdullah H. Özcan</a>, <a href="https://publications.waset.org/abstracts/search?q=Dilara%20Hisar"> Dilara Hisar</a>, <a href="https://publications.waset.org/abstracts/search?q=Yetkin%20Sayar"> Yetkin Sayar</a>, <a href="https://publications.waset.org/abstracts/search?q=Cem%20%C3%9Cnsalan"> Cem Ünsalan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, an automated building and tree detection method is proposed using DSM data and true orthophoto image. A multiscale matched filtering is used on DSM data. Therefore, first watershed transform is applied. Then, Otsu’s thresholding method is used as an adaptive threshold to segment each watershed region. Detected objects are masked with NDVI to separate buildings and trees. The proposed method is able to detect buildings and trees without entering any elevation threshold. We tested our method on ISPRS semantic labeling dataset and obtained promising results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=building%20detection" title="building detection">building detection</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20maximum%20filtering" title=" local maximum filtering"> local maximum filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=matched%20filtering" title=" matched filtering"> matched filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=multiscale" title=" multiscale"> multiscale</a> </p> <a href="https://publications.waset.org/abstracts/59277/building-and-tree-detection-using-multiscale-matched-filtering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59277.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">904</span> Hydrothermally Fabricated 3-D Nanostructure Metal Oxide Sensors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Alenezi">Mohammad Alenezi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hierarchical nanostructures with higher dimensionality, consisting of nanostructure building blocks such as nanowires, nanotubes, or nanosheets are very attractive. They hold great properties like the high surface-to-volume ratio and well-ordered porous structures, which can be very challenging to attain for other mono-morphological nanostructures. Well-ordered hierarchical nanostructures with high surface-to-volume ratios facilitate gas diffusion into their surfaces as well as scattering of light. Therefore, hierarchical nanostructures are expected to perform highly as gas sensors. A multistage controlled hydrothermal synthesis method to fabricate high-performance single ZnO brushlike hierarchical nanostructure gas sensor from initial nanowires is reported. The performance of the sensor based on brush-like hierarchical nanostructure is analyzed and compared to that of a nanowire gas sensor. The hierarchical gas sensor demonstrated high sensitivity toward low concentration of acetone at high speed of response. The enhancement in the hierarchical sensor performance is attributed to the increased surface to volume ratio, reduction in dimensionality of the nanowire building blocks, formation of junctions between the initial nanowire and the secondary nanowires, and enhanced gas diffusion into the surfaces of the hierarchical nanostructures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=metal%20oxide" title="metal oxide">metal oxide</a>, <a href="https://publications.waset.org/abstracts/search?q=nanostructure" title=" nanostructure"> nanostructure</a>, <a href="https://publications.waset.org/abstracts/search?q=hydrothermal" title=" hydrothermal"> hydrothermal</a>, <a href="https://publications.waset.org/abstracts/search?q=sensor" title=" sensor"> sensor</a> </p> <a href="https://publications.waset.org/abstracts/50686/hydrothermally-fabricated-3-d-nanostructure-metal-oxide-sensors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50686.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">272</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">903</span> A Model Based Metaheuristic for Hybrid Hierarchical Community Structure in Social Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Radhia%20Toujani">Radhia Toujani</a>, <a href="https://publications.waset.org/abstracts/search?q=Jalel%20Akaichi"> Jalel Akaichi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, the study of community detection in social networks has received great attention. The hierarchical structure of the network leads to the emergence of the convergence to a locally optimal community structure. In this paper, we aim to avoid this local optimum in the introduced hybrid hierarchical method. To achieve this purpose, we present an objective function where we incorporate the value of structural and semantic similarity based modularity and a metaheuristic namely bees colonies algorithm to optimize our objective function on both hierarchical level divisive and agglomerative. In order to assess the efficiency and the accuracy of the introduced hybrid bee colony model, we perform an extensive experimental evaluation on both synthetic and real networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=social%20network" title="social network">social network</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=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=divisive%20hierarchical%20clustering" title=" divisive hierarchical clustering"> divisive hierarchical clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity" title=" similarity"> similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=modularity" title=" modularity"> modularity</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=bee%20colony" title=" bee colony"> bee colony</a> </p> <a href="https://publications.waset.org/abstracts/64745/a-model-based-metaheuristic-for-hybrid-hierarchical-community-structure-in-social-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64745.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">379</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">902</span> An E-Assessment Website to Implement Hierarchical Aggregate Assessment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Lesage">M. Lesage</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Ra%C3%AEche"> G. Raîche</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Riopel"> M. Riopel</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Fortin"> F. Fortin</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Sebkhi"> D. Sebkhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes a Web server implementation of the hierarchical aggregate assessment process in the field of education. This process describes itself as a field of teamwork assessment where teams can have multiple levels of hierarchy and supervision. This process is applied everywhere and is part of the management, education, assessment and computer science fields. The E-Assessment website named “Cluster” records in its database the students, the course material, the teams and the hierarchical relationships between the students. For the present research, the hierarchical relationships are team member, team leader and group administrator appointments. The group administrators have the responsibility to supervise team leaders. The experimentation of the application has been performed by high school students in geology courses and Canadian army cadets for navigation patrols in teams. This research extends the work of Nance that uses a hierarchical aggregation process similar as the one implemented in the “Cluster” application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=e-learning" title="e-learning">e-learning</a>, <a href="https://publications.waset.org/abstracts/search?q=e-assessment" title=" e-assessment"> e-assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=teamwork%20assessment" title=" teamwork assessment"> teamwork assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20aggregate%20assessment" title=" hierarchical aggregate assessment"> hierarchical aggregate assessment</a> </p> <a href="https://publications.waset.org/abstracts/2666/an-e-assessment-website-to-implement-hierarchical-aggregate-assessment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2666.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">901</span> Agglomerative Hierarchical Clustering Using the Tθ Family of Similarity Measures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salima%20Kouici">Salima Kouici</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelkader%20Khelladi"> Abdelkader Khelladi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we begin with the presentation of the Tθ family of usual similarity measures concerning multidimensional binary data. Subsequently, some properties of these measures are proposed. Finally, the impact of the use of different inter-elements measures on the results of the Agglomerative Hierarchical Clustering Methods is studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20data" title="binary data">binary data</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=T%CE%B8%20measures" title=" Tθ measures"> Tθ measures</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a> </p> <a href="https://publications.waset.org/abstracts/13108/agglomerative-hierarchical-clustering-using-the-tth-family-of-similarity-measures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13108.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">481</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">900</span> Digital Geography and Geographic Information System in Schools: Towards a Hierarchical Geospatial Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mary%20Fargher">Mary Fargher</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines the opportunities of using a more hierarchical approach to geospatial enquiry in using GIS in school geography. A case is made that it is not just the lack of teacher technological knowledge that is stopping some teachers from using GIS in the classroom but that there is a gap in their understanding of how to link GIS use more specifically to the pedagogy of teaching geography with GIS. Using a hierarchical approach to geospatial enquiry as a theoretical framework, the analysis shows clearly how concepts of spatial distribution, interaction, relation, comparison, and temporal relationships can be used by teachers more explicitly to capitalise on the analytical power of GIS and to construct what can be interpreted as powerful geographical knowledge. An exemplar illustrating this approach on the topic of geo-hazards is then presented for critical analysis and discussion. Recommendations are then made for a model of progression for geography teacher education with GIS through hierarchical geospatial enquiry that takes into account beginner, intermediate, and more advanced users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20geography" title="digital geography">digital geography</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=education" title=" education"> education</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20geospatial%20enquiry" title=" hierarchical geospatial enquiry"> hierarchical geospatial enquiry</a>, <a href="https://publications.waset.org/abstracts/search?q=powerful%20geographical%20knowledge" title=" powerful geographical knowledge"> powerful geographical knowledge</a> </p> <a href="https://publications.waset.org/abstracts/125215/digital-geography-and-geographic-information-system-in-schools-towards-a-hierarchical-geospatial-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125215.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">152</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">899</span> A Reconfigurable Microstrip Patch Antenna with Polyphase Filter for Polarization Diversity and Cross Polarization Filtering Operation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lakhdar%20Zaid">Lakhdar Zaid</a>, <a href="https://publications.waset.org/abstracts/search?q=Albane%20Sangiovanni"> Albane Sangiovanni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A reconfigurable microstrip patch antenna with polyphase filter for polarization diversity and cross polarization filtering operation is presented in this paper. In our approach, a polyphase filter is used to obtain the four 90° phase shift outputs to feed a square microstrip patch antenna. The antenna can be switched between four states of polarization in transmission as well as in receiving mode. Switches are interconnected with the polyphase filter network to produce left-hand circular polarization, right-hand circular polarization, horizontal linear polarization, and vertical linear polarization. Additional advantage of using polyphase filter is its filtering capability for cross polarization filtering in right-hand circular polarization and left-hand circular polarization operation. The theoretical and simulated results demonstrated that polyphase filter is a good candidate to drive microstrip patch antenna to accomplish polarization diversity and cross polarization filtering operation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=active%20antenna" title="active antenna">active antenna</a>, <a href="https://publications.waset.org/abstracts/search?q=polarization%20diversity" title=" polarization diversity"> polarization diversity</a>, <a href="https://publications.waset.org/abstracts/search?q=patch%20antenna" title=" patch antenna"> patch antenna</a>, <a href="https://publications.waset.org/abstracts/search?q=polyphase%20filter" title=" polyphase filter"> polyphase filter</a> </p> <a href="https://publications.waset.org/abstracts/59013/a-reconfigurable-microstrip-patch-antenna-with-polyphase-filter-for-polarization-diversity-and-cross-polarization-filtering-operation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59013.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">411</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">898</span> A Near-Optimal Domain Independent Approach for Detecting Approximate Duplicates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelaziz%20Fellah">Abdelaziz Fellah</a>, <a href="https://publications.waset.org/abstracts/search?q=Allaoua%20Maamir"> Allaoua Maamir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a domain-independent merging-cluster filter approach complemented with a set of algorithms for identifying approximate duplicate entities efficiently and accurately within a single and across multiple data sources. The near-optimal merging-cluster filter (MCF) approach is based on the Monge-Elkan well-tuned algorithm and extended with an affine variant of the Smith-Waterman similarity measure. Then we present constant, variable, and function threshold algorithms that work conceptually in a divide-merge filtering fashion for detecting near duplicates as hierarchical clusters along with their corresponding representatives. The algorithms take recursive refinement approaches in the spirit of filtering, merging, and updating, cluster representatives to detect approximate duplicates at each level of the cluster tree. Experiments show a high effectiveness and accuracy of the MCF approach in detecting approximate duplicates by outperforming the seminal Monge-Elkan’s algorithm on several real-world benchmarks and generated datasets. <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=data%20cleaning" title=" data cleaning"> data cleaning</a>, <a href="https://publications.waset.org/abstracts/search?q=approximate%20duplicates" title=" approximate duplicates"> approximate duplicates</a>, <a href="https://publications.waset.org/abstracts/search?q=near-duplicates%20detection" title=" near-duplicates detection"> near-duplicates detection</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining%20applications%20and%20discovery" title=" data mining applications and discovery"> data mining applications and discovery</a> </p> <a href="https://publications.waset.org/abstracts/64998/a-near-optimal-domain-independent-approach-for-detecting-approximate-duplicates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64998.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">387</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">897</span> Semi-Supervised Hierarchical Clustering Given a Reference Tree of Labeled Documents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Zhao">Ying Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xingyan%20Bin"> Xingyan Bin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Semi-supervised clustering algorithms have been shown effective to improve clustering process with even limited supervision. However, semi-supervised hierarchical clustering remains challenging due to the complexities of expressing constraints for agglomerative clustering algorithms. This paper proposes novel semi-supervised agglomerative clustering algorithms to build a hierarchy based on a known reference tree. We prove that by enforcing distance constraints defined by a reference tree during the process of hierarchical clustering, the resultant tree is guaranteed to be consistent with the reference tree. We also propose a framework that allows the hierarchical tree generation be aware of levels of levels of the agglomerative tree under creation, so that metric weights can be learned and adopted at each level in a recursive fashion. The experimental evaluation shows that the additional cost of our contraint-based semi-supervised hierarchical clustering algorithm (HAC) is negligible, and our combined semi-supervised HAC algorithm outperforms the state-of-the-art algorithms on real-world datasets. The experiments also show that our proposed methods can improve clustering performance even with a small number of unevenly distributed labeled data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semi-supervised%20clustering" title="semi-supervised clustering">semi-supervised clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%0D%0Aagglomerative%20clustering" title=" hierarchical agglomerative clustering"> hierarchical agglomerative clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=reference%20trees" title=" reference trees"> reference trees</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20constraints" title=" distance constraints "> distance constraints </a> </p> <a href="https://publications.waset.org/abstracts/19478/semi-supervised-hierarchical-clustering-given-a-reference-tree-of-labeled-documents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19478.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">547</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">896</span> EEG Signal Processing Methods to Differentiate Mental States</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sun%20H.%20Hwang">Sun H. Hwang</a>, <a href="https://publications.waset.org/abstracts/search?q=Young%20E.%20Lee"> Young E. Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunhan%20Ga"> Yunhan Ga</a>, <a href="https://publications.waset.org/abstracts/search?q=Gilwon%20Yoon"> Gilwon Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> EEG is a very complex signal with noises and other bio-potential interferences. EOG is the most distinct interfering signal when EEG signals are measured and analyzed. It is very important how to process raw EEG signals in order to obtain useful information. In this study, the EEG signal processing techniques such as EOG filtering and outlier removal were examined to minimize unwanted EOG signals and other noises. The two different mental states of resting and focusing were examined through EEG analysis. A focused state was induced by letting subjects to watch a red dot on the white screen. EEG data for 32 healthy subjects were measured. EEG data after 60-Hz notch filtering were processed by a commercially available EOG filtering and our presented algorithm based on the removal of outliers. The ratio of beta wave to theta wave was used as a parameter for determining the degree of focusing. The results show that our algorithm was more appropriate than the existing EOG filtering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=EEG" title="EEG">EEG</a>, <a href="https://publications.waset.org/abstracts/search?q=focus" title=" focus"> focus</a>, <a href="https://publications.waset.org/abstracts/search?q=mental%20state" title=" mental state"> mental state</a>, <a href="https://publications.waset.org/abstracts/search?q=outlier" title=" outlier"> outlier</a>, <a href="https://publications.waset.org/abstracts/search?q=signal%20processing" title=" signal processing"> signal processing</a> </p> <a href="https://publications.waset.org/abstracts/62057/eeg-signal-processing-methods-to-differentiate-mental-states" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62057.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">283</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">895</span> Study of Adaptive Filtering Algorithms and the Equalization of Radio Mobile Channel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Said%20Elkassimi">Said Elkassimi</a>, <a href="https://publications.waset.org/abstracts/search?q=Said%20Safi"> Said Safi</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Manaut"> B. Manaut</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presented a study of three algorithms, the equalization algorithm to equalize the transmission channel with ZF and MMSE criteria, application of channel Bran A, and adaptive filtering algorithms LMS and RLS to estimate the parameters of the equalizer filter, i.e. move to the channel estimation and therefore reflect the temporal variations of the channel, and reduce the error in the transmitted signal. So far the performance of the algorithm equalizer with ZF and MMSE criteria both in the case without noise, a comparison of performance of the LMS and RLS algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20filtering%20second%20equalizer" title="adaptive filtering second equalizer">adaptive filtering second equalizer</a>, <a href="https://publications.waset.org/abstracts/search?q=LMS" title=" LMS"> LMS</a>, <a href="https://publications.waset.org/abstracts/search?q=RLS%20%20Bran%20A" title=" RLS Bran A"> RLS Bran A</a>, <a href="https://publications.waset.org/abstracts/search?q=Proakis%20%28B%29%20MMSE" title=" Proakis (B) MMSE"> Proakis (B) MMSE</a>, <a href="https://publications.waset.org/abstracts/search?q=ZF" title=" ZF"> ZF</a> </p> <a href="https://publications.waset.org/abstracts/32853/study-of-adaptive-filtering-algorithms-and-the-equalization-of-radio-mobile-channel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32853.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">313</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">894</span> Efficient Filtering of Graph Based Data Using Graph Partitioning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nileshkumar%20Vaishnav">Nileshkumar Vaishnav</a>, <a href="https://publications.waset.org/abstracts/search?q=Aditya%20Tatu"> Aditya Tatu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An algebraic framework for processing graph signals axiomatically designates the graph adjacency matrix as the shift operator. In this setup, we often encounter a problem wherein we know the filtered output and the filter coefficients, and need to find out the input graph signal. Solution to this problem using direct approach requires O(N3) operations, where N is the number of vertices in graph. In this paper, we adapt the spectral graph partitioning method for partitioning of graphs and use it to reduce the computational cost of the filtering problem. We use the example of denoising of the temperature data to illustrate the efficacy of the approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20signal%20processing" title="graph signal processing">graph signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20partitioning" title=" graph partitioning"> graph partitioning</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20filtering%20on%20graphs" title=" inverse filtering on graphs"> inverse filtering on graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20signal%20processing" title=" algebraic signal processing"> algebraic signal processing</a> </p> <a href="https://publications.waset.org/abstracts/59397/efficient-filtering-of-graph-based-data-using-graph-partitioning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59397.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">893</span> Denoising of Magnetotelluric Signals by Filtering </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rodrigo%20Montufar-Chaveznava">Rodrigo Montufar-Chaveznava</a>, <a href="https://publications.waset.org/abstracts/search?q=Fernando%20Brambila-Paz"> Fernando Brambila-Paz</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivette%20Caldelas"> Ivette Caldelas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present the advances corresponding to the denoising processing of magnetotelluric signals using several filters. In particular, we use the most common spatial domain filters such as median and mean, but we are also using the Fourier and wavelet transform for frequency domain filtering. We employ three datasets obtained at the different sampling rate (128, 4096 and 8192 bps) and evaluate the mean square error, signal-to-noise relation, and peak signal-to-noise relation to compare the kernels and determine the most suitable for each case. The magnetotelluric signals correspond to earth exploration when water is searched. The object is to find a denoising strategy different to the one included in the commercial equipment that is employed in this task. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=denoising" title="denoising">denoising</a>, <a href="https://publications.waset.org/abstracts/search?q=filtering" title=" filtering"> filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetotelluric%20signals" title=" magnetotelluric signals"> magnetotelluric signals</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20transform" title=" wavelet transform"> wavelet transform</a> </p> <a href="https://publications.waset.org/abstracts/91383/denoising-of-magnetotelluric-signals-by-filtering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91383.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">370</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">892</span> Localization of Buried People Using Received Signal Strength Indication Measurement of Wireless Sensor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Feng%20Tao">Feng Tao</a>, <a href="https://publications.waset.org/abstracts/search?q=Han%20Ye"> Han Ye</a>, <a href="https://publications.waset.org/abstracts/search?q=Shaoyi%20Liao"> Shaoyi Liao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> City constructions collapse after earthquake and people will be buried under ruins. Search and rescue should be conducted as soon as possible to save them. Therefore, according to the complicated environment, irregular aftershocks and rescue allow of no delay, a kind of target localization method based on RSSI (Received Signal Strength Indication) is proposed in this article. The target localization technology based on RSSI with the features of low cost and low complexity has been widely applied to nodes localization in WSN (Wireless Sensor Networks). Based on the theory of RSSI transmission and the environment impact to RSSI, this article conducts the experiments in five scenes, and multiple filtering algorithms are applied to original RSSI value in order to establish the signal propagation model with minimum test error respectively. Target location can be calculated from the distance, which can be estimated from signal propagation model, through improved centroid algorithm. Result shows that the localization technology based on RSSI is suitable for large-scale nodes localization. Among filtering algorithms, mixed filtering algorithm (average of average, median and Gaussian filtering) performs better than any other single filtering algorithm, and by using the signal propagation model, the minimum error of distance between known nodes and target node in the five scene is about 3.06m. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=signal%20propagation%20model" title="signal propagation model">signal propagation model</a>, <a href="https://publications.waset.org/abstracts/search?q=centroid%20algorithm" title=" centroid algorithm"> centroid algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=localization" title=" localization"> localization</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20filtering" title=" mixed filtering"> mixed filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=RSSI" title=" RSSI"> RSSI</a> </p> <a href="https://publications.waset.org/abstracts/75284/localization-of-buried-people-using-received-signal-strength-indication-measurement-of-wireless-sensor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75284.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">300</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">891</span> Performance Analysis of Hierarchical Agglomerative Clustering in a Wireless Sensor Network Using Quantitative Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tapan%20Jain">Tapan Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Davender%20Singh%20Saini"> Davender Singh Saini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Clustering is a useful mechanism in wireless sensor networks which helps to cope with scalability and data transmission problems. The basic aim of our research work is to provide efficient clustering using Hierarchical agglomerative clustering (HAC). If the distance between the sensing nodes is calculated using their location then it’s quantitative HAC. This paper compares the various agglomerative clustering techniques applied in a wireless sensor network using the quantitative data. The simulations are done in MATLAB and the comparisons are made between the different protocols using dendrograms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=routing" title="routing">routing</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20clustering" title=" hierarchical clustering"> hierarchical clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative" title=" agglomerative"> agglomerative</a>, <a href="https://publications.waset.org/abstracts/search?q=quantitative" title=" quantitative"> quantitative</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a> </p> <a href="https://publications.waset.org/abstracts/3593/performance-analysis-of-hierarchical-agglomerative-clustering-in-a-wireless-sensor-network-using-quantitative-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3593.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">615</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">890</span> Recurrent Neural Networks with Deep Hierarchical Mixed Structures for Chinese Document Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhaoxin%20Luo">Zhaoxin Luo</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20Zhu"> Michael Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In natural languages, there are always complex semantic hierarchies. Obtaining the feature representation based on these complex semantic hierarchies becomes the key to the success of the model. Several RNN models have recently been proposed to use latent indicators to obtain the hierarchical structure of documents. However, the model that only uses a single-layer latent indicator cannot achieve the true hierarchical structure of the language, especially a complex language like Chinese. In this paper, we propose a deep layered model that stacks arbitrarily many RNN layers equipped with latent indicators. After using EM and training it hierarchically, our model solves the computational problem of stacking RNN layers and makes it possible to stack arbitrarily many RNN layers. Our deep hierarchical model not only achieves comparable results to large pre-trained models on the Chinese short text classification problem but also achieves state of art results on the Chinese long text classification problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nature%20language%20processing" title="nature language processing">nature language processing</a>, <a href="https://publications.waset.org/abstracts/search?q=recurrent%20neural%20network" title=" recurrent neural network"> recurrent neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20structure" title=" hierarchical structure"> hierarchical structure</a>, <a href="https://publications.waset.org/abstracts/search?q=document%20classification" title=" document classification"> document classification</a>, <a href="https://publications.waset.org/abstracts/search?q=Chinese" title=" Chinese"> Chinese</a> </p> <a href="https://publications.waset.org/abstracts/171867/recurrent-neural-networks-with-deep-hierarchical-mixed-structures-for-chinese-document-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171867.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">68</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=hierarchical%20filtering&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&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=hierarchical%20filtering&page=30">30</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&page=31">31</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=hierarchical%20filtering&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>