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: specific databases</title> <meta name="description" content="Search results for: specific databases"> <meta name="keywords" content="specific databases"> <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="specific databases" 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="specific databases"> <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> 8401</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: specific databases</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8401</span> Assessment of Image Databases Used for Human Skin Detection Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saleh%20Alshehri">Saleh Alshehri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Human skin detection is a vital step in many applications. Some of the applications are critical especially those related to security. This leverages the importance of a high-performance detection algorithm. To validate the accuracy of the algorithm, image databases are usually used. However, the suitability of these image databases is still questionable. It is suggested that the suitability can be measured mainly by the span the database covers of the color space. This research investigates the validity of three famous image databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20databases" title="image databases">image databases</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20recognition" title=" pattern recognition"> pattern recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a> </p> <a href="https://publications.waset.org/abstracts/87836/assessment-of-image-databases-used-for-human-skin-detection-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87836.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">271</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">8400</span> Database Playlists: Croatia's Popular Music in the Mirror of Collective Memory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diana%20Grguric">Diana Grguric</a>, <a href="https://publications.waset.org/abstracts/search?q=Robert%20Svetlacic"> Robert Svetlacic</a>, <a href="https://publications.waset.org/abstracts/search?q=Vladimir%20Simovic"> Vladimir Simovic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scientific research analytically explores database playlists by studying the memory culture through Croatian popular radio music. The research is based on the scientific analysis of databases developed on the basis of the playlist of ten Croatian radio stations. The most recent Croatian song on Statehood Day 2008-2013 is analyzed in order to gain insight into their (memory) potential in terms of storing, interpreting and presenting a national identity. The research starts with the general assumption that popular music is an efficient identifier, transmitter, and promoter of national identity. The aim of the scientific research of the database was to analytically reveal specific titles of Croatian popular songs that participate in marking memories and analyzing their symbolic capital to gain insight into the popular music experience of the past and to develop a new method of scientifically based analysis of specific databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=specific%20databases" title="specific databases">specific databases</a>, <a href="https://publications.waset.org/abstracts/search?q=popular%20radio%20music" title=" popular radio music"> popular radio music</a>, <a href="https://publications.waset.org/abstracts/search?q=collective%20memory" title=" collective memory"> collective memory</a>, <a href="https://publications.waset.org/abstracts/search?q=national%20identity" title=" national identity"> national identity</a> </p> <a href="https://publications.waset.org/abstracts/76007/database-playlists-croatias-popular-music-in-the-mirror-of-collective-memory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76007.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">356</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">8399</span> Developing an Information Model of Manufacturing Process for Sustainability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jae%20Hyun%20Lee">Jae Hyun Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Manufacturing companies use life-cycle inventory databases to analyze sustainability of their manufacturing processes. Life cycle inventory data provides reference data which may not be accurate for a specific company. Collecting accurate data of manufacturing processes for a specific company requires enormous time and efforts. An information model of typical manufacturing processes can reduce time and efforts to get appropriate reference data for a specific company. This paper shows an attempt to build an abstract information model which can be used to develop information models for specific manufacturing processes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20information%20model" title="process information model">process information model</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainability" title=" sustainability"> sustainability</a>, <a href="https://publications.waset.org/abstracts/search?q=OWL" title=" OWL"> OWL</a>, <a href="https://publications.waset.org/abstracts/search?q=manufacturing" title=" manufacturing"> manufacturing</a> </p> <a href="https://publications.waset.org/abstracts/5611/developing-an-information-model-of-manufacturing-process-for-sustainability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5611.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">430</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">8398</span> Enhance Security in XML Databases: XLog File for Severity-Aware Trust-Based Access Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A%3A%20Asmawi">A: Asmawi</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20S.%20Affendey"> L. S. Affendey</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20I.%20Udzir"> N. I. Udzir</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Mahmod"> R. Mahmod</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The topic of enhancing security in XML databases is important as it includes protecting sensitive data and providing a secure environment to users. In order to improve security and provide dynamic access control for XML databases, we presented XLog file to calculate user trust values by recording users’ bad transaction, errors and query severities. Severity-aware trust-based access control for XML databases manages the access policy depending on users' trust values and prevents unauthorized processes, malicious transactions and insider threats. Privileges are automatically modified and adjusted over time depending on user behaviour and query severity. Logging in database is an important process and is used for recovery and security purposes. In this paper, the Xlog file is presented as a dynamic and temporary log file for XML databases to enhance the level of security. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=XML%20database" title="XML database">XML database</a>, <a href="https://publications.waset.org/abstracts/search?q=trust-based%20access%20control" title=" trust-based access control"> trust-based access control</a>, <a href="https://publications.waset.org/abstracts/search?q=severity-aware" title=" severity-aware"> severity-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=trust%20values" title=" trust values"> trust values</a>, <a href="https://publications.waset.org/abstracts/search?q=log%20file" title=" log file"> log file</a> </p> <a href="https://publications.waset.org/abstracts/11637/enhance-security-in-xml-databases-xlog-file-for-severity-aware-trust-based-access-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11637.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">8397</span> Analysis of Cyber Activities of Potential Business Customers Using Neo4j Graph Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suglo%20Tohari%20Luri">Suglo Tohari Luri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data analysis is an important aspect of business performance. With the application of artificial intelligence within databases, selecting a suitable database engine for an application design is also very crucial for business data analysis. The application of business intelligence (BI) software into some relational databases such as Neo4j has proved highly effective in terms of customer data analysis. Yet what remains of great concern is the fact that not all business organizations have the neo4j business intelligence software applications to implement for customer data analysis. Further, those with the BI software lack personnel with the requisite expertise to use it effectively with the neo4j database. The purpose of this research is to demonstrate how the Neo4j program code alone can be applied for the analysis of e-commerce website customer visits. As the neo4j database engine is optimized for handling and managing data relationships with the capability of building high performance and scalable systems to handle connected data nodes, it will ensure that business owners who advertise their products at websites using neo4j as a database are able to determine the number of visitors so as to know which products are visited at routine intervals for the necessary decision making. It will also help in knowing the best customer segments in relation to specific goods so as to place more emphasis on their advertisement on the said websites. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data" title="data">data</a>, <a href="https://publications.waset.org/abstracts/search?q=engine" title=" engine"> engine</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligence" title=" intelligence"> intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=customer" title=" customer"> customer</a>, <a href="https://publications.waset.org/abstracts/search?q=neo4j" title=" neo4j"> neo4j</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a> </p> <a href="https://publications.waset.org/abstracts/141336/analysis-of-cyber-activities-of-potential-business-customers-using-neo4j-graph-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141336.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">193</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">8396</span> Perceptions of Academic Staff on the Influences of Librarians and Working Colleagues Towards the Awareness and Use of Electronic Databases in Umaru Musa Yar’adua University, Katsina</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lawal%20Kado">Lawal Kado</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the perceptions of academic staff at Umaru Musa Yar’adua University regarding the influences of librarians and working colleagues on the awareness and use of electronic databases. The study aims to provide insights into the effectiveness of these influences and suggest strategies to improve the usage of electronic databases. Research aim: The aim of this study is to determine the perceptions of academic staff on the influence of librarians and working colleagues towards the awareness and use of electronic databases in Umaru Musa Yar’adua University, Katsina. Methodology: The study adopts a quantitative method and survey research design. The survey questionnaire is distributed to 110 respondents selected through simple random sampling from a population of 523 academic staff. The collected data is analyzed using the Statistical Package for Social Sciences (SPSS) version 23. Findings: The study reveals a high level of general awareness of electronic databases in the university, largely influenced by librarians and colleagues. Librarians have played a crucial role in making academic staff aware of the available databases. The sources of information for awareness include colleagues, social media, e-mails from the library, and internet searching. Theoretical importance: This study contributes to the literature by examining the perceptions of academic staff, which can inform policymakers and stakeholders in developing strategies to maximize the use of electronic databases. Data collection and analysis procedures: The data is collected through a survey questionnaire that utilizes the Likert scaling technique. The closed-ended questions are analyzed using SPSS 23. Question addressed: The paper addresses the question of how librarians and working colleagues influence the awareness and use of electronic databases among academic staff. Conclusion: The study concludes that the influence of librarians and working colleagues significantly contributes to the awareness and use of electronic databases among academic staff. The paper recommends the establishment of dedicated departments or units for marketing library resources to further promote the usage of electronic databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=awareness" title="awareness">awareness</a>, <a href="https://publications.waset.org/abstracts/search?q=electronic%20databases" title=" electronic databases"> electronic databases</a>, <a href="https://publications.waset.org/abstracts/search?q=academic%20staff" title=" academic staff"> academic staff</a>, <a href="https://publications.waset.org/abstracts/search?q=unified%20theory%20of%20acceptance%20and%20use%20of%20technology" title=" unified theory of acceptance and use of technology"> unified theory of acceptance and use of technology</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20influence" title=" social influence"> social influence</a> </p> <a href="https://publications.waset.org/abstracts/178313/perceptions-of-academic-staff-on-the-influences-of-librarians-and-working-colleagues-towards-the-awareness-and-use-of-electronic-databases-in-umaru-musa-yaradua-university-katsina" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/178313.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">89</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">8395</span> In silico Subtractive Genomics Approach for Identification of Strain-Specific Putative Drug Targets among Hypothetical Proteins of Drug-Resistant Klebsiella pneumoniae Strain 825795-1</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Umairah%20Natasya%20Binti%20Mohd%20Omeershffudin">Umairah Natasya Binti Mohd Omeershffudin</a>, <a href="https://publications.waset.org/abstracts/search?q=Suresh%20Kumar"> Suresh Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Klebsiella pneumoniae, a Gram-negative enteric bacterium that causes nosocomial and urinary tract infections. Particular concern is the global emergence of multidrug-resistant (MDR) strains of Klebsiella pneumoniae. Characterization of antibiotic resistance determinants at the genomic level plays a critical role in understanding, and potentially controlling, the spread of multidrug-resistant (MDR) pathogens. In this study, drug-resistant Klebsiella pneumoniae strain 825795-1 was investigated with extensive computational approaches aimed at identifying novel drug targets among hypothetical proteins. We have analyzed 1099 hypothetical proteins available in genome. We have used in-silico genome subtraction methodology to design potential and pathogen-specific drug targets against Klebsiella pneumoniae. We employed bioinformatics tools to subtract the strain-specific paralogous and host-specific homologous sequences from the bacterial proteome. The sorted 645 proteins were further refined to identify the essential genes in the pathogenic bacterium using the database of essential genes (DEG). We found 135 unique essential proteins in the target proteome that could be utilized as novel targets to design newer drugs. Further, we identified 49 cytoplasmic protein as potential drug targets through sub-cellular localization prediction. Further, we investigated these proteins in the DrugBank databases, and 11 of the unique essential proteins showed druggability according to the FDA approved drug bank databases with diverse broad-spectrum property. The results of this study will facilitate discovery of new drugs against Klebsiella pneumoniae. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pneumonia" title="pneumonia">pneumonia</a>, <a href="https://publications.waset.org/abstracts/search?q=drug%20target" title=" drug target"> drug target</a>, <a href="https://publications.waset.org/abstracts/search?q=hypothetical%20protein" title=" hypothetical protein"> hypothetical protein</a>, <a href="https://publications.waset.org/abstracts/search?q=subtractive%20genomics" title=" subtractive genomics"> subtractive genomics</a> </p> <a href="https://publications.waset.org/abstracts/82108/in-silico-subtractive-genomics-approach-for-identification-of-strain-specific-putative-drug-targets-among-hypothetical-proteins-of-drug-resistant-klebsiella-pneumoniae-strain-825795-1" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82108.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">176</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">8394</span> Comparison between RILM, JSTOR, and WorldCat Used to Search for Secondary Literature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Stacy%20Jarvis">Stacy Jarvis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Databases such as JSTOR, RILM and WorldCat have been the main source and storage of literature in the music orb. The Reference Index to Music Literature is a bibliographic database of over 2.6 million citations to writings about music from over 70 countries. The Research Institute produces RILM for the Study of Music at the University of Buffalo. JSTOR is an e-library of academic journals, books, and primary sources. Database JSTOR helps scholars find, utilise, and build upon a vast range of literature through a powerful teaching and research platform. Another database, WorldCat, is the world's biggest library catalogue, assisting scholars in finding library materials online. An evaluation of these databases in the music sphere is conducted by looking into the description and intended use and finding similarities and differences among them. Through comparison, it is found that these aim to serve different purposes, though they have the same goal of providing and storing literature. Also, since each database has different parts of literature that it majors on, the intended use of the three databases is evaluated. This can be found in the description, scope, and intended uses section. These areas are crucial to the research as it addresses the functional or literature differences among the three databases. It is also found that these databases have different quantitative potentials. This is determined by addressing the year each database began collecting literature and the number of articles, periodicals, albums, conference proceedings, music, dissertations, digital media, essays collections, journal articles, monographs, online resources, reviews, and reference materials that can be found in each one of them. This can be found in the sections- description, scope and intended uses and the importance of the database in identifying literature on different topics. To compare the delivery of services to the users, the importance of databases in identifying literature on different topics is also addressed in the section -the importance of databases in identifying literature on different topics. Even though these databases are used in research, they all have disadvantages and advantages. This is addressed in the sections on advantages and disadvantages. This will be significant in determining which of the three is the best. Also, it will help address how the shortcomings of one database can be addressed by utilising two databases together while conducting research. It is addressed in the section- a combination of RILM and JSTOR. All this information revolves around the idea that a huge amount of quantitative and qualitative data can be found in the presented databases on music and digital content; however, each of the given databases has a different construction and material features contributing to the musical scholarship in its way. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RILM" title="RILM">RILM</a>, <a href="https://publications.waset.org/abstracts/search?q=JSTOR" title=" JSTOR"> JSTOR</a>, <a href="https://publications.waset.org/abstracts/search?q=WorldCat" title=" WorldCat"> WorldCat</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a>, <a href="https://publications.waset.org/abstracts/search?q=literature" title=" literature"> literature</a>, <a href="https://publications.waset.org/abstracts/search?q=research" title=" research"> research</a> </p> <a href="https://publications.waset.org/abstracts/160019/comparison-between-rilm-jstor-and-worldcat-used-to-search-for-secondary-literature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160019.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">83</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">8393</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">161</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">8392</span> Building an Integrated Relational Database from Swiss Nutrition National Survey and Swiss Health Datasets for Data Mining Purposes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ilona%20Mewes">Ilona Mewes</a>, <a href="https://publications.waset.org/abstracts/search?q=Helena%20Jenzer"> Helena Jenzer</a>, <a href="https://publications.waset.org/abstracts/search?q=Farshideh%20Einsele"> Farshideh Einsele</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Objective: The objective of the study was to integrate two big databases from Swiss nutrition national survey (menuCH) and Swiss health national survey 2012 for data mining purposes. Each database has a demographic base data. An integrated Swiss database is built to later discover critical food consumption patterns linked with lifestyle diseases known to be strongly tied with food consumption. Design: Swiss nutrition national survey (menuCH) with approx. 2000 respondents from two different surveys, one by Phone and the other by questionnaire along with Swiss health national survey 2012 with 21500 respondents were pre-processed, cleaned and finally integrated to a unique relational database. Results: The result of this study is an integrated relational database from the Swiss nutritional and health databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=health%20informatics" title="health informatics">health informatics</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=nutritional%20and%20health%20databases" title=" nutritional and health databases"> nutritional and health databases</a>, <a href="https://publications.waset.org/abstracts/search?q=nutritional%20and%20chronical%20databases" title=" nutritional and chronical databases"> nutritional and chronical databases</a> </p> <a href="https://publications.waset.org/abstracts/132719/building-an-integrated-relational-database-from-swiss-nutrition-national-survey-and-swiss-health-datasets-for-data-mining-purposes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132719.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">112</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">8391</span> Computational Screening of Secretory Proteins with Brain-Specific Expression in Glioblastoma Multiforme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sumera">Sumera</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanila%20Amber"> Sanila Amber</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatima%20Javed%20Mirza"> Fatima Javed Mirza</a>, <a href="https://publications.waset.org/abstracts/search?q=Amjad%20Ali"> Amjad Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Saadia%20Zahid"> Saadia Zahid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Glioblastoma multiforme (GBM) is a widely spread and fatal primary brain tumor with an increased risk of relapse in spite of aggressive treatment. The current procedures for GBM diagnosis include invasive procedures i.e. resection or biopsy, to acquire tumor mass. Implementation of negligibly invasive tests as a potential diagnostic technique and biofluid-based monitoring of GBM stresses on discovering biomarkers in CSF and blood. Therefore, we performed a comprehensive in silico analysis to identify potential circulating biomarkers for GBM. Initially, six gene and protein databases were utilized to mine brain-specific proteins. The resulting proteins were filtered using a channel of five tools to predict the secretory proteins. Subsequently, the expression profile of the secreted proteins was verified in the brain and blood using two databases. Additional verification of the resulting proteins was done using Plasma Proteome Database (PPD) to confirm their presence in blood. The final set of proteins was searched in literature for their relationship with GBM, keeping a special emphasis on secretome proteome. 2145 proteins were firstly mined as brain-specific, out of which 69 proteins were identified as secretory in nature. Verification of expression profile in brain and blood eliminated 58 proteins from the 69 proteins, providing a final list of 11 proteins. Further verification of these 11 proteins further eliminated 2 proteins, giving a final set of nine secretory proteins i.e. OPCML, NPTX1, LGI1, CNTN2, LY6H, SLIT1, CREG2, GDF1 and SERPINI1. Out of these 9 proteins, 7 were found to be linked to GBM, whereas 2 proteins are not investigated in GBM so far. We propose that these secretory proteins can serve as potential circulating biomarker signatures of GBM and will facilitate the development of minimally invasive diagnostic methods and novel therapeutic interventions for GBM. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=glioblastoma%20multiforme" title="glioblastoma multiforme">glioblastoma multiforme</a>, <a href="https://publications.waset.org/abstracts/search?q=secretory%20proteins" title=" secretory proteins"> secretory proteins</a>, <a href="https://publications.waset.org/abstracts/search?q=brain%20secretome" title=" brain secretome"> brain secretome</a>, <a href="https://publications.waset.org/abstracts/search?q=biomarkers" title=" biomarkers"> biomarkers</a> </p> <a href="https://publications.waset.org/abstracts/144723/computational-screening-of-secretory-proteins-with-brain-specific-expression-in-glioblastoma-multiforme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144723.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">8390</span> Utilization of CD-ROM Database as a Storage and Retrieval System by Students of Nasarawa State University Keffi</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suleiman%20Musa">Suleiman Musa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The utilization of CD-ROM as a storage and retrieval system by Nasarawa State University Keffi (NSUK) Library is crucial in preserving and dissemination of information to students and staff. This study investigated the utilization of CD-ROM Database storage and retrieval system by students of NUSK. Data was generated using structure questionnaire. One thousand and fifty two (1052) respondents were randomly selected among post-graduate and under-graduate students. Eight hundred and ten (810) questionnaires were returned, but only five hundred and ninety three (593) questionnaires were well completed and useful. The study found that post-graduate students use CD-ROM Databases more often than the under-graduate students in NSUK. The result of the study revealed that knowledge about CD-ROM Database 33.22% got it through library staff. 29.69% use CD-ROM once a month. Large number of users 45.70% purposely uses CD-ROM Databases for study and research. In fact, lack of users’ orientation amount to 58.35% of problems faced, while 31.20% lack of trained staff make it more difficult for utilization of CD-ROM Database. Major numbers of users 38.28% are neither satisfied nor dissatisfied, while a good number of them 27.99% are satisfied. Then 1.52% is highly dissatisfied but could not give reasons why. However, to ensure effective utilization of CD-ROM Database storage and retrieval system by students of NSUK, the following recommendations are made: effort should be made to encourage under-graduate in using CD-ROM Database. The institution should conduct orientation/induction course for students on CD-ROM Databases in the library. There is need for NSUK to produce in house databases on their CD-ROM for easy access by users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=utilization" title="utilization">utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases" title=" CD-ROM databases"> CD-ROM databases</a>, <a href="https://publications.waset.org/abstracts/search?q=storage" title=" storage"> storage</a>, <a href="https://publications.waset.org/abstracts/search?q=retrieval" title=" retrieval"> retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=students" title=" students"> students</a> </p> <a href="https://publications.waset.org/abstracts/14420/utilization-of-cd-rom-database-as-a-storage-and-retrieval-system-by-students-of-nasarawa-state-university-keffi" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14420.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">445</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">8389</span> Cleaning of Scientific References in Large Patent Databases Using Rule-Based Scoring and Clustering </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emiel%20Caron">Emiel Caron</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Patent databases contain patent related data, organized in a relational data model, and are used to produce various patent statistics. These databases store raw data about scientific references cited by patents. For example, Patstat holds references to tens of millions of scientific journal publications and conference proceedings. These references might be used to connect patent databases with bibliographic databases, e.g. to study to the relation between science, technology, and innovation in various domains. Problematic in such studies is the low data quality of the references, i.e. they are often ambiguous, unstructured, and incomplete. Moreover, a complete bibliographic reference is stored in only one attribute. Therefore, a computerized cleaning and disambiguation method for large patent databases is developed in this work. The method uses rule-based scoring and clustering. The rules are based on bibliographic metadata, retrieved from the raw data by regular expressions, and are transparent and adaptable. The rules in combination with string similarity measures are used to detect pairs of records that are potential duplicates. Due to the scoring, different rules can be combined, to join scientific references, i.e. the rules reinforce each other. The scores are based on expert knowledge and initial method evaluation. After the scoring, pairs of scientific references that are above a certain threshold, are clustered by means of single-linkage clustering algorithm to form connected components. The method is designed to disambiguate all the scientific references in the Patstat database. The performance evaluation of the clustering method, on a large golden set with highly cited papers, shows on average a 99% precision and a 95% recall. The method is therefore accurate but careful, i.e. it weighs precision over recall. Consequently, separate clusters of high precision are sometimes formed, when there is not enough evidence for connecting scientific references, e.g. in the case of missing year and journal information for a reference. The clusters produced by the method can be used to directly link the Patstat database with bibliographic databases as the Web of Science or Scopus. <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=data%20cleaning" title=" data cleaning"> data cleaning</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20disambiguation" title=" data disambiguation"> data disambiguation</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=patent%20analysis" title=" patent analysis"> patent analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=scientometrics" title=" scientometrics"> scientometrics</a> </p> <a href="https://publications.waset.org/abstracts/80011/cleaning-of-scientific-references-in-large-patent-databases-using-rule-based-scoring-and-clustering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80011.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">194</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">8388</span> Recommender System Based on Mining Graph Databases for Data-Intensive Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mostafa%20Gamal">Mostafa Gamal</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoda%20K.%20Mohamed"> Hoda K. Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=Islam%20El-Maddah"> Islam El-Maddah</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Hamdi"> Ali Hamdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, many digital documents on the web have been created due to the rapid growth of ’social applications’ communities or ’Data-intensive applications’. The evolution of online-based multimedia data poses new challenges in storing and querying large amounts of data for online recommender systems. Graph data models have been shown to be more efficient than relational data models for processing complex data. This paper will explain the key differences between graph and relational databases, their strengths and weaknesses, and why using graph databases is the best technology for building a realtime recommendation system. Also, The paper will discuss several similarity metrics algorithms that can be used to compute a similarity score of pairs of nodes based on their neighbourhoods or their properties. Finally, the paper will discover how NLP strategies offer the premise to improve the accuracy and coverage of realtime recommendations by extracting the information from the stored unstructured knowledge, which makes up the bulk of the world’s data to enrich the graph database with this information. As the size and number of data items are increasing rapidly, the proposed system should meet current and future needs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20databases" title="graph databases">graph databases</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</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=similarity%20metrics" title=" similarity metrics"> similarity metrics</a> </p> <a href="https://publications.waset.org/abstracts/163018/recommender-system-based-on-mining-graph-databases-for-data-intensive-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163018.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">104</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">8387</span> Life Cycle Datasets for the Ornamental Stone Sector</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Isabella%20Bianco">Isabella Bianco</a>, <a href="https://publications.waset.org/abstracts/search?q=Gian%20Andrea%20Blengini"> Gian Andrea Blengini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The environmental impact related to ornamental stones (such as marbles and granites) is largely debated. Starting from the industrial revolution, continuous improvements of machineries led to a higher exploitation of this natural resource and to a more international interaction between markets. As a consequence, the environmental impact of the extraction and processing of stones has increased. Nevertheless, if compared with other building materials, ornamental stones are generally more durable, natural, and recyclable. From the scientific point of view, studies on stone life cycle sustainability have been carried out, but these are often partial or not very significant because of the high percentage of approximations and assumptions in calculations. This is due to the lack, in life cycle databases (e.g. Ecoinvent, Thinkstep, and ELCD), of datasets about the specific technologies employed in the stone production chain. For example, databases do not contain information about diamond wires, chains or explosives, materials commonly used in quarries and transformation plants. The project presented in this paper aims to populate the life cycle databases with specific data of specific stone processes. To this goal, the methodology follows the standardized approach of Life Cycle Assessment (LCA), according to the requirements of UNI 14040-14044 and to the International Reference Life Cycle Data System (ILCD) Handbook guidelines of the European Commission. The study analyses the processes of the entire production chain (from-cradle-to-gate system boundaries), including the extraction of benches, the cutting of blocks into slabs/tiles and the surface finishing. Primary data have been collected in Italian quarries and transformation plants which use technologies representative of the current state-of-the-art. Since the technologies vary according to the hardness of the stone, the case studies comprehend both soft stones (marbles) and hard stones (gneiss). In particular, data about energy, materials and emissions were collected in marble basins of Carrara and in Beola and Serizzo basins located in the province of Verbano Cusio Ossola. Data were then elaborated through an appropriate software to build a life cycle model. The model was realized setting free parameters that allow an easy adaptation to specific productions. Through this model, the study aims to boost the direct participation of stone companies and encourage the use of LCA tool to assess and improve the stone sector environmental sustainability. At the same time, the realization of accurate Life Cycle Inventory data aims at making available, to researchers and stone experts, ILCD compliant datasets of the most significant processes and technologies related to the ornamental stone sector. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=life%20cycle%20assessment" title="life cycle assessment">life cycle assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=LCA%20datasets" title=" LCA datasets"> LCA datasets</a>, <a href="https://publications.waset.org/abstracts/search?q=ornamental%20stone" title=" ornamental stone"> ornamental stone</a>, <a href="https://publications.waset.org/abstracts/search?q=stone%20environmental%20impact" title=" stone environmental impact"> stone environmental impact</a> </p> <a href="https://publications.waset.org/abstracts/60723/life-cycle-datasets-for-the-ornamental-stone-sector" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60723.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">233</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">8386</span> A Novel Framework for User-Friendly Ontology-Mediated Access to Relational Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Efthymios%20Chondrogiannis">Efthymios Chondrogiannis</a>, <a href="https://publications.waset.org/abstracts/search?q=Vassiliki%20Andronikou"> Vassiliki Andronikou</a>, <a href="https://publications.waset.org/abstracts/search?q=Efstathios%20Karanastasis"> Efstathios Karanastasis</a>, <a href="https://publications.waset.org/abstracts/search?q=Theodora%20Varvarigou"> Theodora Varvarigou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A large amount of data is typically stored in relational databases (DB). The latter can efficiently handle user queries which intend to elicit the appropriate information from data sources. However, direct access and use of this data requires the end users to have an adequate technical background, while they should also cope with the internal data structure and values presented. Consequently the information retrieval is a quite difficult process even for IT or DB experts, taking into account the limited contributions of relational databases from the conceptual point of view. Ontologies enable users to formally describe a domain of knowledge in terms of concepts and relations among them and hence they can be used for unambiguously specifying the information captured by the relational database. However, accessing information residing in a database using ontologies is feasible, provided that the users are keen on using semantic web technologies. For enabling users form different disciplines to retrieve the appropriate data, the design of a Graphical User Interface is necessary. In this work, we will present an interactive, ontology-based, semantically enable web tool that can be used for information retrieval purposes. The tool is totally based on the ontological representation of underlying database schema while it provides a user friendly environment through which the users can graphically form and execute their queries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ontologies" title="ontologies">ontologies</a>, <a href="https://publications.waset.org/abstracts/search?q=relational%20databases" title=" relational databases"> relational databases</a>, <a href="https://publications.waset.org/abstracts/search?q=SPARQL" title=" SPARQL"> SPARQL</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20interface" title=" web interface"> web interface</a> </p> <a href="https://publications.waset.org/abstracts/21795/a-novel-framework-for-user-friendly-ontology-mediated-access-to-relational-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21795.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">8385</span> An Analysis of Sequential Pattern Mining on Databases Using Approximate Sequential Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Suneetha">J. Suneetha</a>, <a href="https://publications.waset.org/abstracts/search?q=Vijayalaxmi"> Vijayalaxmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sequential Pattern Mining involves applying data mining methods to large data repositories to extract usage patterns. Sequential pattern mining methodologies used to analyze the data and identify patterns. The patterns have been used to implement efficient systems can recommend on previously observed patterns, in making predictions, improve usability of systems, detecting events, and in general help in making strategic product decisions. In this paper, identified performance of approximate sequential pattern mining defines as identifying patterns approximately shared with many sequences. Approximate sequential patterns can effectively summarize and represent the databases by identifying the underlying trends in the data. Conducting an extensive and systematic performance over synthetic and real data. The results demonstrate that ApproxMAP effective and scalable in mining large sequences databases with long patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20data" title="multiple data">multiple data</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20analysis" title=" performance analysis"> performance analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern" title=" sequential pattern"> sequential pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20database%20scalability" title=" sequence database scalability"> sequence database scalability</a> </p> <a href="https://publications.waset.org/abstracts/46782/an-analysis-of-sequential-pattern-mining-on-databases-using-approximate-sequential-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46782.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">342</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">8384</span> Recent Advances in Data Warehouse</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fahad%20Hanash%20Alzahrani">Fahad Hanash Alzahrani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes some recent advances in a quickly developing area of data storing and processing based on Data Warehouses and Data Mining techniques, which are associated with software, hardware, data mining algorithms and visualisation techniques having common features for any specific problems and tasks of their implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20warehouse" title="data warehouse">data warehouse</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery%20in%20databases" title=" knowledge discovery in databases"> knowledge discovery in databases</a>, <a href="https://publications.waset.org/abstracts/search?q=on-line%20analytical%20processing" title=" on-line analytical processing"> on-line analytical processing</a> </p> <a href="https://publications.waset.org/abstracts/63299/recent-advances-in-data-warehouse" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63299.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">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">8383</span> Generating Insights from Data Using a Hybrid Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Allmin%20Susaiyah">Allmin Susaiyah</a>, <a href="https://publications.waset.org/abstracts/search?q=Aki%20H%C3%A4rm%C3%A4"> Aki Härmä</a>, <a href="https://publications.waset.org/abstracts/search?q=Milan%20Petkovi%C4%87"> Milan Petković</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Automatic generation of insights from data using insight mining systems (IMS) is useful in many applications, such as personal health tracking, patient monitoring, and business process management. Existing IMS face challenges in controlling insight extraction, scaling to large databases, and generalising to unseen domains. In this work, we propose a hybrid approach consisting of rule-based and neural components for generating insights from data while overcoming the aforementioned challenges. Firstly, a rule-based data 2CNL component is used to extract statistically significant insights from data and represent them in a controlled natural language (CNL). Secondly, a BERTSum-based CNL2NL component is used to convert these CNLs into natural language texts. We improve the model using task-specific and domain-specific fine-tuning. Our approach has been evaluated using statistical techniques and standard evaluation metrics. We overcame the aforementioned challenges and observed significant improvement with domain-specific fine-tuning. <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=insight%20mining" title=" insight mining"> insight mining</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20generation" title=" natural language generation"> natural language generation</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-trained%20language%20models" title=" pre-trained language models"> pre-trained language models</a> </p> <a href="https://publications.waset.org/abstracts/159536/generating-insights-from-data-using-a-hybrid-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159536.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">119</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">8382</span> The Role of Cyfra 21-1 in Diagnosing Non Small Cell Lung Cancer (NSCLC)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20J.%20T.%20Kevin%20Mozes">H. J. T. Kevin Mozes</a>, <a href="https://publications.waset.org/abstracts/search?q=Dyah%20Purnamasari"> Dyah Purnamasari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Lung cancer accounted for the fourth most common cancer in Indonesia. 85% of all lung cancer cases are the Non-Small Cell Lung Cancer (NSCLC). The indistinct signs and symptoms of NSCLC sometimes lead to misdiagnosis. The gold standard assessment for the diagnosis of NSCLC is the histopathological biopsy, which is invasive. Cyfra 21-1 is a tumor marker, which can be found in the intermediate protein structure in the epitel. The accuracy of Cyfra 21-1 in diagnosing NSCLC is not yet known, so this report is made to seek the answer for the question above. Methods: Literature searching is done using online databases. Proquest and Pubmed are online databases being used in this report. Then, literature selection is done by excluding and including based on inclusion criterias and exclusion criterias. The selected literature is then being appraised using the criteria of validity, importance, and validity. Results: From six journals appraised, five of them are valid. Sensitivity value acquired from all five literature is ranging from 50-84.5 %, meanwhile the specificity is 87.8 %-94.4 %. Likelihood the ratio of all appraised literature is ranging from 5.09 -10.54, which categorized to Intermediate High. Conclusion: Serum Cyfra 21-1 is a sensitive and very specific tumor marker for diagnosis of non-small cell lung cancer (NSCLC). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cyfra%2021-1" title="cyfra 21-1">cyfra 21-1</a>, <a href="https://publications.waset.org/abstracts/search?q=diagnosis" title=" diagnosis"> diagnosis</a>, <a href="https://publications.waset.org/abstracts/search?q=nonsmall%20cell%20lung%20cancer" title=" nonsmall cell lung cancer"> nonsmall cell lung cancer</a>, <a href="https://publications.waset.org/abstracts/search?q=NSCLC" title=" NSCLC"> NSCLC</a>, <a href="https://publications.waset.org/abstracts/search?q=tumor%20marker" title=" tumor marker "> tumor marker </a> </p> <a href="https://publications.waset.org/abstracts/39507/the-role-of-cyfra-21-1-in-diagnosing-non-small-cell-lung-cancer-nsclc" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39507.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">232</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">8381</span> Ontology-Driven Knowledge Discovery and Validation from Admission Databases: A Structural Causal Model Approach for Polytechnic Education in Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bernard%20Igoche%20Igoche">Bernard Igoche Igoche</a>, <a href="https://publications.waset.org/abstracts/search?q=Olumuyiwa%20Matthew"> Olumuyiwa Matthew</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20Bednar"> Peter Bednar</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Gegov"> Alexander Gegov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents an ontology-driven approach for knowledge discovery and validation from admission databases in Nigerian polytechnic institutions. The research aims to address the challenges of extracting meaningful insights from vast amounts of admission data and utilizing them for decision-making and process improvement. The proposed methodology combines the knowledge discovery in databases (KDD) process with a structural causal model (SCM) ontological framework. The admission database of Benue State Polytechnic Ugbokolo (Benpoly) is used as a case study. The KDD process is employed to mine and distill knowledge from the database, while the SCM ontology is designed to identify and validate the important features of the admission process. The SCM validation is performed using the conditional independence test (CIT) criteria, and an algorithm is developed to implement the validation process. The identified features are then used for machine learning (ML) modeling and prediction of admission status. The results demonstrate the adequacy of the SCM ontological framework in representing the admission process and the high predictive accuracies achieved by the ML models, with k-nearest neighbors (KNN) and support vector machine (SVM) achieving 92% accuracy. The study concludes that the proposed ontology-driven approach contributes to the advancement of educational data mining and provides a foundation for future research in this domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=admission%20databases" title="admission databases">admission databases</a>, <a href="https://publications.waset.org/abstracts/search?q=educational%20data%20mining" title=" educational data mining"> educational data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=ontology-driven%20knowledge%20discovery" title=" ontology-driven knowledge discovery"> ontology-driven knowledge discovery</a>, <a href="https://publications.waset.org/abstracts/search?q=polytechnic%20education" title=" polytechnic education"> polytechnic education</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20causal%20model" title=" structural causal model"> structural causal model</a> </p> <a href="https://publications.waset.org/abstracts/184064/ontology-driven-knowledge-discovery-and-validation-from-admission-databases-a-structural-causal-model-approach-for-polytechnic-education-in-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184064.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">64</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">8380</span> A Framework for SQL Learning: Linking Learning Taxonomy, Cognitive Model and Cross Cutting Factors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Huda%20Al%20Shuaily">Huda Al Shuaily</a>, <a href="https://publications.waset.org/abstracts/search?q=Karen%20Renaud"> Karen Renaud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Databases comprise the foundation of most software systems. System developers inevitably write code to query these databases. The de facto language for querying is SQL and this, consequently, is the default language taught by higher education institutions. There is evidence that learners find it hard to master SQL, harder than mastering other programming languages such as Java. Educators do not agree about explanations for this seeming anomaly. Further investigation may well reveal the reasons. In this paper, we report on our investigations into how novices learn SQL, the actual problems they experience when writing SQL, as well as the differences between expert and novice SQL query writers. We conclude by presenting a model of SQL learning that should inform the instructional material design process better to support the SQL learning process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pattern" title="pattern">pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=SQL" title=" SQL"> SQL</a>, <a href="https://publications.waset.org/abstracts/search?q=learning" title=" learning"> learning</a>, <a href="https://publications.waset.org/abstracts/search?q=model" title=" model"> model</a> </p> <a href="https://publications.waset.org/abstracts/53944/a-framework-for-sql-learning-linking-learning-taxonomy-cognitive-model-and-cross-cutting-factors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53944.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">254</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">8379</span> 3D Object Retrieval Based on Similarity Calculation in 3D Computer Aided Design Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Fradi">Ahmed Fradi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, recent technological advances in the acquisition, modeling, and processing of three-dimensional (3D) objects data lead to the creation of models stored in huge databases, which are used in various domains such as computer vision, augmented reality, game industry, medicine, CAD (Computer-aided design), 3D printing etc. On the other hand, the industry is currently benefiting from powerful modeling tools enabling designers to easily and quickly produce 3D models. The great ease of acquisition and modeling of 3D objects make possible to create large 3D models databases, then, it becomes difficult to navigate them. Therefore, the indexing of 3D objects appears as a necessary and promising solution to manage this type of data, to extract model information, retrieve an existing model or calculate similarity between 3D objects. The objective of the proposed research is to develop a framework allowing easy and fast access to 3D objects in a CAD models database with specific indexing algorithm to find objects similar to a reference model. Our main objectives are to study existing methods of similarity calculation of 3D objects (essentially shape-based methods) by specifying the characteristics of each method as well as the difference between them, and then we will propose a new approach for indexing and comparing 3D models, which is suitable for our case study and which is based on some previously studied methods. Our proposed approach is finally illustrated by an implementation, and evaluated in a professional context. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CAD" title="CAD">CAD</a>, <a href="https://publications.waset.org/abstracts/search?q=3D%20object%20retrieval" title=" 3D object retrieval"> 3D object retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=shape%20based%20retrieval" title=" shape based retrieval"> shape based retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20calculation" title=" similarity calculation"> similarity calculation</a> </p> <a href="https://publications.waset.org/abstracts/78341/3d-object-retrieval-based-on-similarity-calculation-in-3d-computer-aided-design-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78341.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">262</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">8378</span> Formulation of a Rapid Earthquake Risk Ranking Criteria for National Bridges in the National Capital Region Affected by the West Valley Fault Using GIS Data Integration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=George%20Mariano%20Soriano">George Mariano Soriano</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, a Rapid Earthquake Risk Ranking Criteria was formulated by integrating various existing maps and databases by the Department of Public Works and Highways (DPWH) and Philippine Institute of Volcanology and Seismology (PHIVOLCS). Utilizing Geographic Information System (GIS) software, the above-mentioned maps and databases were used in extracting seismic hazard parameters and bridge vulnerability characteristics in order to rank the seismic damage risk rating of bridges in the National Capital Region. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bridge" title="bridge">bridge</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=hazard" title=" hazard"> hazard</a>, <a href="https://publications.waset.org/abstracts/search?q=risk" title=" risk"> risk</a>, <a href="https://publications.waset.org/abstracts/search?q=vulnerability" title=" vulnerability"> vulnerability</a> </p> <a href="https://publications.waset.org/abstracts/60021/formulation-of-a-rapid-earthquake-risk-ranking-criteria-for-national-bridges-in-the-national-capital-region-affected-by-the-west-valley-fault-using-gis-data-integration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60021.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">409</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8377</span> JREM: An Approach for Formalising Models in the Requirements Phase with JSON and NoSQL Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aitana%20Alonso-Nogueira">Aitana Alonso-Nogueira</a>, <a href="https://publications.waset.org/abstracts/search?q=Helia%20Est%C3%A9vez-Fern%C3%A1ndez"> Helia Estévez-Fernández</a>, <a href="https://publications.waset.org/abstracts/search?q=Isa%C3%ADas%20Garc%C3%ADa"> Isaías García</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an approach to reduce some of its current flaws in the requirements phase inside the software development process. It takes the software requirements of an application, makes a conceptual modeling about it and formalizes it within JSON documents. This formal model is lodged in a NoSQL database which is document-oriented, that is, MongoDB, because of its advantages in flexibility and efficiency. In addition, this paper underlines the contributions of the detailed approach and shows some applications and benefits for the future work in the field of automatic code generation using model-driven engineering tools. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conceptual%20modelling" title="conceptual modelling">conceptual modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=JSON" title=" JSON"> JSON</a>, <a href="https://publications.waset.org/abstracts/search?q=NoSQL%20databases" title=" NoSQL databases"> NoSQL databases</a>, <a href="https://publications.waset.org/abstracts/search?q=requirements%20engineering" title=" requirements engineering"> requirements engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20development" title=" software development"> software development</a> </p> <a href="https://publications.waset.org/abstracts/58140/jrem-an-approach-for-formalising-models-in-the-requirements-phase-with-json-and-nosql-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58140.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">378</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">8376</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">8375</span> A Protein-Wave Alignment Tool for Frequency Related Homologies Identification in Polypeptide Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Victor%20Prevost">Victor Prevost</a>, <a href="https://publications.waset.org/abstracts/search?q=Solene%20Landerneau"> Solene Landerneau</a>, <a href="https://publications.waset.org/abstracts/search?q=Michel%20Duhamel"> Michel Duhamel</a>, <a href="https://publications.waset.org/abstracts/search?q=Joel%20Sternheimer"> Joel Sternheimer</a>, <a href="https://publications.waset.org/abstracts/search?q=Olivier%20Gallet"> Olivier Gallet</a>, <a href="https://publications.waset.org/abstracts/search?q=Pedro%20Ferrandiz"> Pedro Ferrandiz</a>, <a href="https://publications.waset.org/abstracts/search?q=Marwa%20Mokni"> Marwa Mokni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The search for homologous proteins is one of the ongoing challenges in biology and bioinformatics. Traditionally, a pair of proteins is thought to be homologous when they originate from the same ancestral protein. In such a case, their sequences share similarities, and advanced scientific research effort is spent to investigate this question. On this basis, we propose the Protein-Wave Alignment Tool (”P-WAT”) developed within the framework of the France Relance 2030 plan. Our work takes into consideration the mass-related wave aspect of protein biosynthesis, by associating specific frequencies to each amino acid according to its mass. Amino acids are then regrouped within their mass category. This way, our algorithm produces specific alignments in addition to those obtained with a common amino acid coding system. For this purpose, we develop the ”P-WAT” original algorithm, able to address large protein databases, with different attributes such as species, protein names, etc. that allow us to align user’s requests with a set of specific protein sequences. The primary intent of this algorithm is to achieve efficient alignments, in this specific conceptual frame, by minimizing execution costs and information loss. Our algorithm identifies sequence similarities by searching for matches of sub-sequences of different sizes, referred to as primers. Our algorithm relies on Boolean operations upon a dot plot matrix to identify primer amino acids common to both proteins which are likely to be part of a significant alignment of peptides. From those primers, dynamic programming-like traceback operations generate alignments and alignment scores based on an adjusted PAM250 matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=protein" title="protein">protein</a>, <a href="https://publications.waset.org/abstracts/search?q=alignment" title=" alignment"> alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=homologous" title=" homologous"> homologous</a>, <a href="https://publications.waset.org/abstracts/search?q=Genodic" title=" Genodic"> Genodic</a> </p> <a href="https://publications.waset.org/abstracts/155064/a-protein-wave-alignment-tool-for-frequency-related-homologies-identification-in-polypeptide-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155064.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">113</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">8374</span> De-Novo Structural Elucidation from Mass/NMR Spectra</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ismael%20Zamora">Ismael Zamora</a>, <a href="https://publications.waset.org/abstracts/search?q=Elisabeth%20Ortega"> Elisabeth Ortega</a>, <a href="https://publications.waset.org/abstracts/search?q=Tatiana%20Radchenko"> Tatiana Radchenko</a>, <a href="https://publications.waset.org/abstracts/search?q=Guillem%20Plasencia"> Guillem Plasencia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The structure elucidation based on Mass Spectra (MS) data of unknown substances is an unresolved problem that affects many different fields of application. The recent overview of software available for structure elucidation of small molecules has shown the demand for efficient computational tool that will be able to perform structure elucidation of unknown small molecules and peptides. We developed an algorithm for De-Novo fragment analysis based on MS data that proposes a set of scored and ranked structures that are compatible with the MS and MSMS spectra. Several different algorithms were developed depending on the initial set of fragments and the structure building processes. Also, in all cases, several scores for the final molecule ranking were computed. They were validated with small and middle databases (DB) with the eleven test set compounds. Similar results were obtained from any of the databases that contained the fragments of the expected compound. We presented an algorithm. Or De-Novo fragment analysis based on only mass spectrometry (MS) data only that proposed a set of scored/ranked structures that was validated on different types of databases and showed good results as proof of concept. Moreover, the solutions proposed by Mass Spectrometry were submitted to the prediction of NMR spectra in order to elucidate which of the proposed structures was compatible with the NMR spectra collected. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=De%20Novo" title="De Novo">De Novo</a>, <a href="https://publications.waset.org/abstracts/search?q=structure%20elucidation" title=" structure elucidation"> structure elucidation</a>, <a href="https://publications.waset.org/abstracts/search?q=mass%20spectrometry" title=" mass spectrometry"> mass spectrometry</a>, <a href="https://publications.waset.org/abstracts/search?q=NMR" title=" NMR"> NMR</a> </p> <a href="https://publications.waset.org/abstracts/58568/de-novo-structural-elucidation-from-massnmr-spectra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58568.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">295</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">8373</span> Patient-Specific Modeling Algorithm for Medical Data Based on AUC</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guilherme%20Ribeiro">Guilherme Ribeiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexandre%20Oliveira"> Alexandre Oliveira</a>, <a href="https://publications.waset.org/abstracts/search?q=Antonio%20Ferreira"> Antonio Ferreira</a>, <a href="https://publications.waset.org/abstracts/search?q=Shyam%20Visweswaran"> Shyam Visweswaran</a>, <a href="https://publications.waset.org/abstracts/search?q=Gregory%20Cooper"> Gregory Cooper</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Patient-specific models are instance-based learning algorithms that take advantage of the particular features of the patient case at hand to predict an outcome. We introduce two patient-specific algorithms based on decision tree paradigm that use AUC as a metric to select an attribute. We apply the patient specific algorithms to predict outcomes in several datasets, including medical datasets. Compared to the patient-specific decision path (PSDP) entropy-based and CART methods, the AUC-based patient-specific decision path models performed equivalently on area under the ROC curve (AUC). Our results provide support for patient-specific methods being a promising approach for making clinical predictions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approach%20instance-based" title="approach instance-based">approach instance-based</a>, <a href="https://publications.waset.org/abstracts/search?q=area%20under%20the%20ROC%20curve" title=" area under the ROC curve"> area under the ROC curve</a>, <a href="https://publications.waset.org/abstracts/search?q=patient-specific%20decision%20path" title=" patient-specific decision path"> patient-specific decision path</a>, <a href="https://publications.waset.org/abstracts/search?q=clinical%20predictions" title=" clinical predictions"> clinical predictions</a> </p> <a href="https://publications.waset.org/abstracts/35519/patient-specific-modeling-algorithm-for-medical-data-based-on-auc" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35519.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">479</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">8372</span> Multivariate Data Analysis for Automatic Atrial Fibrillation Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zouhair%20Haddi">Zouhair Haddi</a>, <a href="https://publications.waset.org/abstracts/search?q=Stephane%20Delliaux"> Stephane Delliaux</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean-Francois%20Pons"> Jean-Francois Pons</a>, <a href="https://publications.waset.org/abstracts/search?q=Ismail%20Kechaf"> Ismail Kechaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean-Claude%20De%20Haro"> Jean-Claude De Haro</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustapha%20Ouladsine"> Mustapha Ouladsine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Atrial fibrillation (AF) has been considered as the most common cardiac arrhythmia, and a major public health burden associated with significant morbidity and mortality. Nowadays, telemedical approaches targeting cardiac outpatients situate AF among the most challenged medical issues. The automatic, early, and fast AF detection is still a major concern for the healthcare professional. Several algorithms based on univariate analysis have been developed to detect atrial fibrillation. However, the published results do not show satisfactory classification accuracy. This work was aimed at resolving this shortcoming by proposing multivariate data analysis methods for automatic AF detection. Four publicly-accessible sets of clinical data (AF Termination Challenge Database, MIT-BIH AF, Normal Sinus Rhythm RR Interval Database, and MIT-BIH Normal Sinus Rhythm Databases) were used for assessment. All time series were segmented in 1 min RR intervals window and then four specific features were calculated. Two pattern recognition methods, i.e., Principal Component Analysis (PCA) and Learning Vector Quantization (LVQ) neural network were used to develop classification models. PCA, as a feature reduction method, was employed to find important features to discriminate between AF and Normal Sinus Rhythm. Despite its very simple structure, the results show that the LVQ model performs better on the analyzed databases than do existing algorithms, with high sensitivity and specificity (99.19% and 99.39%, respectively). The proposed AF detection holds several interesting properties, and can be implemented with just a few arithmetical operations which make it a suitable choice for telecare applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=atrial%20fibrillation" title="atrial fibrillation">atrial fibrillation</a>, <a href="https://publications.waset.org/abstracts/search?q=multivariate%20data%20analysis" title=" multivariate data analysis"> multivariate data analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=automatic%20detection" title=" automatic detection"> automatic detection</a>, <a href="https://publications.waset.org/abstracts/search?q=telemedicine" title=" telemedicine"> telemedicine</a> </p> <a href="https://publications.waset.org/abstracts/55423/multivariate-data-analysis-for-automatic-atrial-fibrillation-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55423.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">267</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=specific%20databases&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&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=specific%20databases&page=280">280</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&page=281">281</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=specific%20databases&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>