• Title/Summary/Keyword: Tree-Based Network

Search Result 632, Processing Time 0.032 seconds

Multi-dimensional Analysis and Prediction Model for Tourist Satisfaction

  • Shrestha, Deepanjal;Wenan, Tan;Gaudel, Bijay;Rajkarnikar, Neesha;Jeong, Seung Ryul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.2
    • /
    • pp.480-502
    • /
    • 2022
  • This work assesses the degree of satisfaction tourists receive as final recipients in a tourism destination based on the fact that satisfied tourists can make a significant contribution to the growth and continuous improvement of a tourism business. The work considers Pokhara, the tourism capital of Nepal as a prefecture of study. A stratified sampling methodology with open-ended survey questions is used as a primary source of data for a sample size of 1019 for both international and domestic tourists. The data collected through a survey is processed using a data mining tool to perform multi-dimensional analysis to discover information patterns and visualize clusters. Further, supervised machine learning algorithms, kNN, Decision tree, Support vector machine, Random forest, Neural network, Naive Bayes, and Gradient boost are used to develop models for training and prediction purposes for the survey data. To find the best model for prediction purposes, different performance matrices are used to evaluate a model for performance, accuracy, and robustness. The best model is used in constructing a learning-enabled model for predicting tourists as satisfied, neutral, and unsatisfied visitors. This work is very important for tourism business personnel, government agencies, and tourism stakeholders to find information on tourist satisfaction and factors that influence it. Though this work was carried out for Pokhara city of Nepal, the study is equally relevant to any other tourism destination of similar nature.

A genome-wide approach to the systematic and comprehensive analysis of LIM gene family in sorghum (Sorghum bicolor L.)

  • Md. Abdur Rauf Sarkar;Salim Sarkar;Md Shohel Ul Islam;Fatema Tuz Zohra;Shaikh Mizanur Rahman
    • Genomics & Informatics
    • /
    • v.21 no.3
    • /
    • pp.36.1-36.19
    • /
    • 2023
  • The LIM domain-containing proteins are dominantly found in plants and play a significant role in various biological processes such as gene transcription as well as actin cytoskeletal organization. Nevertheless, genome-wide identification as well as functional analysis of the LIM gene family have not yet been reported in the economically important plant sorghum (Sorghum bicolor L.). Therefore, we conducted an in silico identification and characterization of LIM genes in S. bicolor genome using integrated bioinformatics approaches. Based on phylogenetic tree analysis and conserved domain, we identified five LIM genes in S. bicolor (SbLIM) genome corresponding to Arabidopsis LIM (AtLIM) genes. The conserved domain, motif as well as gene structure analyses of the SbLIM gene family showed the similarity within the SbLIM and AtLIM members. The gene ontology (GO) enrichment study revealed that the candidate LIM genes are directly involved in cytoskeletal organization and various other important biological as well as molecular pathways. Some important families of regulating transcription factors such as ERF, MYB, WRKY, NAC, bZIP, C2H2, Dof, and G2-like were detected by analyzing their interaction network with identified SbLIM genes. The cis-acting regulatory elements related to predicted SbLIM genes were identified as responsive to light, hormones, stress, and other functions. The present study will provide valuable useful information about LIM genes in sorghum which would pave the way for the future study of functional pathways of candidate SbLIM genes as well as their regulatory factors in wet-lab experiments.

A Comparative Study of Prediction Models for College Student Dropout Risk Using Machine Learning: Focusing on the case of N university (머신러닝을 활용한 대학생 중도탈락 위험군의 예측모델 비교 연구 : N대학 사례를 중심으로)

  • So-Hyun Kim;Sung-Hyoun Cho
    • Journal of The Korean Society of Integrative Medicine
    • /
    • v.12 no.2
    • /
    • pp.155-166
    • /
    • 2024
  • Purpose : This study aims to identify key factors for predicting dropout risk at the university level and to provide a foundation for policy development aimed at dropout prevention. This study explores the optimal machine learning algorithm by comparing the performance of various algorithms using data on college students' dropout risks. Methods : We collected data on factors influencing dropout risk and propensity were collected from N University. The collected data were applied to several machine learning algorithms, including random forest, decision tree, artificial neural network, logistic regression, support vector machine (SVM), k-nearest neighbor (k-NN) classification, and Naive Bayes. The performance of these models was compared and evaluated, with a focus on predictive validity and the identification of significant dropout factors through the information gain index of machine learning. Results : The binary logistic regression analysis showed that the year of the program, department, grades, and year of entry had a statistically significant effect on the dropout risk. The performance of each machine learning algorithm showed that random forest performed the best. The results showed that the relative importance of the predictor variables was highest for department, age, grade, and residence, in the order of whether or not they matched the school location. Conclusion : Machine learning-based prediction of dropout risk focuses on the early identification of students at risk. The types and causes of dropout crises vary significantly among students. It is important to identify the types and causes of dropout crises so that appropriate actions and support can be taken to remove risk factors and increase protective factors. The relative importance of the factors affecting dropout risk found in this study will help guide educational prescriptions for preventing college student dropout.

Analysis of Pinewood Nematode Damage Expansion in Gyeonggi Province Based on Monitoring Data from 2008 to 2015 (경기도의 소나무재선충병 피해 확산 양상 분석: 2008 ~ 2015년 예찰 데이터를 기반으로)

  • Park, Wan-Hyeok;Ko, Dongwook W.;Kwon, Tae-Sung;Nam, Youngwoo;Kwon, Young Dae
    • Journal of Korean Society of Forest Science
    • /
    • v.107 no.4
    • /
    • pp.486-496
    • /
    • 2018
  • Pine wilt disease (PWD) in Gyeonggi province was first detected in Gwangju in 2007, and ever since has caused extensive damage. Insect vector and host tree in Gyeonggi province are Monochamus saltuarius and Pinus koraiensis, respectively, which are different from the southern region that consist of Monochamus alternatus and Pinus densiflora. Consequently, spread and mortality characteristics may be different, but our understanding is limited. In this research, we utilized the spatial data of newly infected trees in Gyeonggi province from 2008 to 2015 to analyze how it is related to various environmental and human factors, such as elevation, forest type, and road network. We also analyzed the minimum distance from newly infected tree to last year's closest infected tree to examine the dispersal characteristics based on new outbreak locations. Annual number of newly infected trees rapidly increased from 2008 to 2013, which then stabilized. Number of administrative districts with infected trees was 5 in 2012, 11 in 2013, and 15 in 2014. Most of the infected trees was Pinus koraiensis, with its proportion close to 90% throughout the survey period. Mean distance to newly infected trees dramatically decreased over time, from 4,111 m from 2012 to 2013, to approximately 600 m from 2013 to 2014 and 2014 to 2015. Most new infections occurred in higher elevation over time. Distance to road from newly infected trees continuously increased, suggesting that natural diffusion dispersal is increasingly occurring compared to human-influenced dispersal over time.

Finding the One-to-One Optimum Path Considering User's Route Perception Characteristics of Origin and Destination (Focused on the Origin-Based Formulation and Algorithm) (출발지와 도착지의 경로인지특성을 반영한 One-to-One 최적경로탐색 (출발지기반 수식 및 알고리즘을 중심으로))

  • Shin, Seong-Il;Sohn, Kee-Min;Cho, Chong-Suk;Cho, Tcheol-Woong;Kim, Won-Keun
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.99-110
    • /
    • 2005
  • Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

Restoration Plan of Changwon and Nam Streams Based on the Results of Diagnostic Assessment (생태적 진단결과에 기초한 창원천과 남천의 복원계획)

  • An, Ji Hong;Lim, Chi Hong;Jung, Song Hie;Kim, A Reum;Woo, Dong Min;Lee, Chang Seok
    • Journal of Korean Society on Water Environment
    • /
    • v.33 no.5
    • /
    • pp.511-524
    • /
    • 2017
  • This study was carried out for the purpose of creating a restoration plan to improve the ecological quality of the Changwon and Nam streams. Based upon the results of comprehensive diagnostic assessment, restoration priority was given to the upstream reach, where conservation status is relatively superior. Restoration level was usually determined to practice active restoration as conservation, and the states of both Changwon and Nam streams were not so good. Restoration plans, by reach, were classified into "upstream", "midstream", and "downstream" were suggested in both terms of horizontal section frame and vegetation-based on the result of diagnostic assessment and the reference information. "Upstream", "mid-stream" and the "downstream" of Changwon and Nam streams were classified into "small-gravel- mountainous", "small-sand-plain", and "small-clay-plain streams" respectively (based on scale, and substrate and slope of river bed). The spatial arrangement of vegetation was laid out in diagram form by reflecting micro-topography and the water level of the horizontal section of river. Information regarding species composition was recommended as dominant species, which appear frequently in three vegetation zones composed of herbaceous plants, shrubs and trees and sub-tree- dominated zones divided by reflecting disturbance regime, depending on position on the horizontal section of river. Moreover, there have been prepared not only plans to improve the terrestrial ecosystems around the streams but also plans to create ecological networks, which can serve to improve the ecologic quality of the whole regional environment by serving to connect streams and terrestrial ecosystems, a process probably necessary and definitely recommended to realize true (genuine) restoration. Plans for ecological parks and networks were prepared by mimicking the species composition of Alnus japanica community, Zelkova serrata community, Carpinus laxiflora community, Quercus aliena community, and Q. serrata community.

Endless debates on the extant basal-most angiosperm (현생 기저 피자식물에 대한 끝나지 않는 논쟁)

  • Kim, Sangtae
    • Korean Journal of Plant Taxonomy
    • /
    • v.40 no.1
    • /
    • pp.1-15
    • /
    • 2010
  • Recognizing a basal group in a taxon is one of the most important factors involved in understanding the evolutionary history of that group of life. Many botanists have suggested a sister to all other angiosperms to understand the origin and rapid diversification of angiosperms based on morphological and fossil evidence. Recent technical advances in molecular biology and the accumulation of molecular phylogenetic data have provided evidence of the extant basal-most angiosperm which is a sister to all other angiosperms. Although it is still arguable, most plant taxonomists agree that Amborella trichopoda Baill., a species (monotypic genus and monotypic family) distributed in New Caledonia, is a sister to all other extant angiosperms based on evidence from the following molecular approaches: 1) classical phylogenetic analyses based on multiple genes (or DNA regions), 2) analyses of a tree network of duplicated gene families, and 3) gene-structural evidence. As an alternative hypothesis with relatively minor evidence, some researchers have also suggested that Amborella and Nymphaeaceae form a clade that is a sister to all other angiosperms. Debate regarding the basal-most angiosperms is still ongoing and is currently one of the hot issues in plant evolutionary biology. We expect that sequencing of the whole genome of Amborella as an evolutionary model plant and subsequent studies based on this genome sequence will provide information regarding the origin and rapid diversification of angiosperms, which is Darwin's so called abominable mystery.

Cycle Extendability of Torus Sub-Graphs in the Enhanced Pyramid Network (개선된 피라미드 네트워크에서 토러스 부그래프의 사이클 확장성)

  • Chang, Jung-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1183-1193
    • /
    • 2010
  • The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

Implementation of Secure System for Blockchain-based Smart Meter Aggregation (블록체인 기반 스마트 미터 집계 보안 시스템 구축)

  • Kim, Yong-Gil;Moon, Kyung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.1-11
    • /
    • 2020
  • As an important basic building block of the smart grid environment, smart meter provides real-time electricity consumption information to the utility. However, ensuring information security and privacy in the smart meter data aggregation process is a non-trivial task. Even though the secure data aggregation for the smart meter has been a lot of attention from both academic and industry researchers in recent years, most of these studies are not secure against internal attackers or cannot provide data integrity. Besides, their computation costs are not satisfactory because the bilinear pairing operation or the hash-to-point operation is performed at the smart meter system. Recently, blockchains or distributed ledgers are an emerging technology that has drawn considerable interest from energy supply firms, startups, technology developers, financial institutions, national governments and the academic community. In particular, blockchains are identified as having the potential to bring significant benefits and innovation for the electricity consumption network. This study suggests a distributed, privacy-preserving, and simple secure smart meter data aggregation system, backed up by Blockchain technology. Smart meter data are aggregated and verified by a hierarchical Merkle tree, in which the consensus protocol is supported by the practical Byzantine fault tolerance algorithm.

A Time-Parameterized Data-Centric Storage Method for Storage Utilization and Energy Efficiency in Sensor Networks (센서 네트워크에서 저장 공간의 활용성과 에너지 효율성을 위한 시간 매개변수 기반의 데이타 중심 저장 기법)

  • Park, Yong-Hun;Yoon, Jong-Hyun;Seo, Bong-Min;Kim, June;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.36 no.2
    • /
    • pp.99-111
    • /
    • 2009
  • In wireless sensor networks, various schemes have been proposed to store and process sensed data efficiently. A Data-Centric Storage(DCS) scheme assigns distributed data regions to sensors and stores sensed data to the sensor which is responsible for the data region overlapping the data. The DCS schemes have been proposed to reduce the communication cost for transmitting data and process exact queries and range queries efficiently. Recently, KDDCS that readjusts the distributed data regions dynamically to sensors based on K-D tree was proposed to overcome the storage hot-spots. However, the existing DCS schemes including KDDCS suffer from Query Hot-Spots that are formed if the query regions are not uniformly distributed. As a result, it causes reducing the life time of the sensor network. In this paper, we propose a new DCS scheme, called TPDCS(Time-Parameterized DCS), that avoids the problems of storage hot-spots and query hot-spots. To decentralize the skewed. data and queries, the data regions are assigned by a time dimension as well as data dimensions in our proposed scheme. Therefore, TPDCS extends the life time of sensor networks. It is shown through various experiments that our scheme outperform the existing schemes.