• Title/Summary/Keyword: Rank Algorithm

Search Result 282, Processing Time 0.026 seconds

Intention-Oriented Itinerary Recommendation Through Bridging Physical Trajectories and Online Social Networks

  • Meng, Xiangxu;Lin, Xinye;Wang, Xiaodong;Zhou, Xingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3197-3218
    • /
    • 2012
  • Compared with traditional itinerary planning, intention-oriented itinerary recommendations can provide more flexible activity planning without requiring the user's predetermined destinations and is especially helpful for those in unfamiliar environments. The rank and classification of points of interest (POI) from location-based social networks (LBSN) are used to indicate different user intentions. The mining of vehicles' physical trajectories can provide exact civil traffic information for path planning. This paper proposes a POI category-based itinerary recommendation framework combining physical trajectories with LBSN. Specifically, a Voronoi graph-based GPS trajectory analysis method is utilized to build traffic information networks, and an ant colony algorithm for multi-object optimization is implemented to locate the most appropriate itineraries. We conduct experiments on datasets from the Foursquare and GeoLife projects. A test of users' satisfaction with the recommended items is also performed. Our results show that the satisfaction level reaches an average of 80%.

Ontology Matching Method Based on Word Embedding and Structural Similarity

  • Hongzhou Duan;Yuxiang Sun;Yongju Lee
    • International journal of advanced smart convergence
    • /
    • v.12 no.3
    • /
    • pp.75-88
    • /
    • 2023
  • In a specific domain, experts have different understanding of domain knowledge or different purpose of constructing ontology. These will lead to multiple different ontologies in the domain. This phenomenon is called the ontology heterogeneity. For research fields that require cross-ontology operations such as knowledge fusion and knowledge reasoning, the ontology heterogeneity has caused certain difficulties for research. In this paper, we propose a novel ontology matching model that combines word embedding and a concatenated continuous bag-of-words model. Our goal is to improve word vectors and distinguish the semantic similarity and descriptive associations. Moreover, we make the most of textual and structural information from the ontology and external resources. We represent the ontology as a graph and use the SimRank algorithm to calculate the structural similarity. Our approach employs a similarity queue to achieve one-to-many matching results which provide a wider range of insights for subsequent mining and analysis. This enhances and refines the methodology used in ontology matching.

Using PageRank Algorithm to Improve Coupling Metrics (페이지랭크 알고리즘을 이용한 결합도 척도의 개선)

  • Park, Cheol-Hyun;Ryu, Sung-Tae;Lee, Eun-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.1405-1408
    • /
    • 2011
  • 소프트웨어 품질 측정은 소프트웨어 공학의 필수적인 요소이다. 소프트웨어 품질 척도 중 하나인 결합도는 모듈간의 얼마나 강하게 연결되어있는지를 나타낸다. 결합도는 소프트웨어의 결함-경향성, 모듈화, 재사용성, 변경-경향성 등 다양한 목적으로 사용된다. 기존의 결합도 척도들은 메소드호출 횟수에 의해서 결정되는데, 이는 메소드의 가중치를 고려하지 않기 때문에 결합도를 정확히 측정 하지 못한다. 본 논문은 페이지랭크 알고리즘을 이용하여 메소드의 가중치를 측정하고, 이를 이용한 결합도 척도 개선 방법에 대해 제안한다. 본 논문의 유효성을 검증하기 위하여, 4 개의 오픈 소스 프로젝트를 대상으로 기존의 방법과 개선된 방법으로 결합도 척도 3 개를 측정하였다. 개선된 결합도 3 개는 유지보수의 척도로 사용되는 변경-경향성(Change-Proneness)과의 상관계수가 기존의 결합도 척도에 비하여 눈의 띄게 향상되었다. 따라서 개선된 결합도 척도는 소프트웨어 품질을 더 정확하게 측정할 수 있다.

Automatic Recommendation of (IP)TV programs based on A Rank Model using Collaborative Filtering (협업 필터링을 이용한 순위 정렬 모델 기반 (IP)TV 프로그램 자동 추천)

  • Kim, Eun-Hui;Pyo, Shin-Jee;Kim, Mun-Churl
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.238-252
    • /
    • 2009
  • Due to the rapid increase of available contents via the convergence of broadcasting and internet, the efficient access to personally preferred contents has become an important issue. In this paper, for recommendation scheme for TV programs using a collaborative filtering technique is studied. For recommendation of user preferred TV programs, our proposed recommendation scheme consists of offline and online computation. About offline computation, we propose reasoning implicitly each user's preference in TV programs in terms of program contents, genres and channels, and propose clustering users based on each user's preferences in terms of genres and channels by dynamic fuzzy clustering method. After an active user logs in, to recommend TV programs to the user with high accuracy, the online computation includes pulling similar users to an active user by similarity measure based on the standard preference list of active user and filtering-out of the watched TV programs of the similar users, which do not exist in EPG and ranking of the remaining TV programs by proposed rank model. Especially, in this paper, the BM (Best Match) algorithm is extended to make the recommended TV programs be ranked by taking into account user's preferences. The experimental results show that the proposed scheme with the extended BM model yields 62.1% of prediction accuracy in top five recommendations for the TV watching history of 2,441 people.

Development of a Model to Predict the Number of Visitors to Local Festivals Using Machine Learning (머신러닝을 활용한 지역축제 방문객 수 예측모형 개발)

  • Lee, In-Ji;Yoon, Hyun Shik
    • The Journal of Information Systems
    • /
    • v.29 no.3
    • /
    • pp.35-52
    • /
    • 2020
  • Purpose Local governments in each region actively hold local festivals for the purpose of promoting the region and revitalizing the local economy. Existing studies related to local festivals have been actively conducted in tourism and related academic fields. Empirical studies to understand the effects of latent variables on local festivals and studies to analyze the regional economic impacts of festivals occupy a large proportion. Despite of practical need, since few researches have been conducted to predict the number of visitors, one of the criteria for evaluating the performance of local festivals, this study developed a model for predicting the number of visitors through various observed variables using a machine learning algorithm and derived its implications. Design/methodology/approach For a total of 593 festivals held in 2018, 6 variables related to the region considering population size, administrative division, and accessibility, and 15 variables related to the festival such as the degree of publicity and word of mouth, invitation singer, weather and budget were set for the training data in machine learning algorithm. Since the number of visitors is a continuous numerical data, random forest, Adaboost, and linear regression that can perform regression analysis among the machine learning algorithms were used. Findings This study confirmed that a prediction of the number of visitors to local festivals is possible using a machine learning algorithm, and the possibility of using machine learning in research in the tourism and related academic fields, including the study of local festivals, was captured. From a practical point of view, the model developed in this study is used to predict the number of visitors to the festival to be held in the future, so that the festival can be evaluated in advance and the demand for related facilities, etc. can be utilized. In addition, the RReliefF rank result can be used. Considering this, it will be possible to improve the existing local festivals or refer to the planning of a new festival.

An Adaptive Decision-Directed Equalizer using Iterative Hyperplane Projection for SIMO systems (IHP 알고리즘을 이용한 SIMO 시스템용 적응 직접 결정 등화기 연구)

  • Lee Won-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1C
    • /
    • pp.82-91
    • /
    • 2005
  • This paper introduces an efficient affine projection algorithm(APA) using iterative hyperplane projection. Among various fast converging adaptation algorithms, APA has been preferred to be employed for various applications due to its inherent effectiveness against the rank deficient problem. However, the amount of complexity of the conventional APA could not be negligible because of the accomplishment of sample matrix inversion(SMI). Moreover, the 'shifting invariance property' usually exploited in single channel case does not hold for the application of space-time decision-directed equalizer(STDE) deployed in single-input-multi-output(SIMO) systems. Thus, it is impossible to utilize the fast adaptation schemes such as fast transversal filter(FlF) having low-complexity. To accomplish such tasks, this paper introduces the low-complexity APA by employing hyperplane projection algorithm, which shows the excellent tracking capability as well as the fast convergence. In order to confirm th validity of the proposed method, its performance is evaluated under wireless SIMO channel in respect to bit error rate(BER) behavior and computational complexity.

The Blog Ranking Algorithm Reflecting Trend Index (트렌드 지수를 반영한 블로그 랭킹 알고리즘)

  • Lee, Yong-Suk;Kim, Hyoung Joong
    • Journal of Digital Contents Society
    • /
    • v.18 no.3
    • /
    • pp.551-558
    • /
    • 2017
  • The growth of blogs has two aspect of providing various information and marketing. This study collected the rankings of blog posts of large portal using OpenAPI and investigated the features of blogs ranked through the exploratory data analysis technique. As a result of the analysis, it was found that the influence of the blogger and the recent creation date of the post were highly influential factors in the top rank. Due to the weakness of these evaluation algorithms, there was a problem of showing the search results which is concentrated to the power blogger's post. In this study, we propose an algorithm that improves the reliability of content by adding the reliability DB information which is verified by the experts and reflects the fairness of the application of the ranking score through the trend index indicating various public interests. Improved algorithms have made it possible to provide more reliable information in the search results of the relevant field and have an effect of making it difficult to manipulate ranking by illegal applications that increase the number of visitors.

Method of Analyzing Important Variables using Machine Learning-based Golf Putting Direction Prediction Model (머신러닝 기반 골프 퍼팅 방향 예측 모델을 활용한 중요 변수 분석 방법론)

  • Kim, Yeon Ho;Cho, Seung Hyun;Jung, Hae Ryun;Lee, Ki Kwang
    • Korean Journal of Applied Biomechanics
    • /
    • v.32 no.1
    • /
    • pp.1-8
    • /
    • 2022
  • Objective: This study proposes a methodology to analyze important variables that have a significant impact on the putting direction prediction using a machine learning-based putting direction prediction model trained with IMU sensor data. Method: Putting data were collected using an IMU sensor measuring 12 variables from 6 adult males in their 20s at K University who had no golf experience. The data was preprocessed so that it could be applied to machine learning, and a model was built using five machine learning algorithms. Finally, by comparing the performance of the built models, the model with the highest performance was selected as the proposed model, and then 12 variables of the IMU sensor were applied one by one to analyze important variables affecting the learning performance. Results: As a result of comparing the performance of five machine learning algorithms (K-NN, Naive Bayes, Decision Tree, Random Forest, and Light GBM), the prediction accuracy of the Light GBM-based prediction model was higher than that of other algorithms. Using the Light GBM algorithm, which had excellent performance, an experiment was performed to rank the importance of variables that affect the direction prediction of the model. Conclusion: Among the five machine learning algorithms, the algorithm that best predicts the putting direction was the Light GBM algorithm. When the model predicted the putting direction, the variable that had the greatest influence was the left-right inclination (Roll).

Comparison of the Quality of Various Polychromatic and Monochromatic Dual-Energy CT Images with or without a Metal Artifact Reduction Algorithm to Evaluate Total Knee Arthroplasty

  • Hye Jung Choo;Sun Joo Lee;Dong Wook Kim;Yoo Jin Lee;Jin Wook Baek;Ji-yeon Han;Young Jin Heo
    • Korean Journal of Radiology
    • /
    • v.22 no.8
    • /
    • pp.1341-1351
    • /
    • 2021
  • Objective: To compare the quality of various polychromatic and monochromatic images with or without using an iterative metal artifact reduction algorithm (iMAR) obtained from a dual-energy computed tomography (CT) to evaluate total knee arthroplasty. Materials and Methods: We included 58 patients (28 male and 30 female; mean age [range], 71.4 [61-83] years) who underwent 74 knee examinations after total knee arthroplasty using dual-energy CT. CT image sets consisted of polychromatic image sets that linearly blended 80 kVp and tin-filtered 140 kVp using weighting factors of 0.4, 0, and -0.3, and monochromatic images at 130, 150, 170, and 190 keV. These image sets were obtained with and without applying iMAR, creating a total of 14 image sets. Two readers qualitatively ranked the image quality (1 [lowest quality] through 14 [highest quality]). Volumes of high- and low-density artifacts and contrast-to-noise ratios (CNRs) between the bone and fat tissue were quantitatively measured in a subset of 25 knees unaffected by metal artifacts. Results: iMAR-applied, polychromatic images using weighting factors of -0.3 and 0.0 (P-0.3i and P0.0i, respectively) showed the highest image-quality rank scores (median of 14 for both by one reader and 13 and 14, respectively, by the other reader; p < 0.001). All iMAR-applied image series showed higher rank scores than the iMAR-unapplied ones. The smallest volumes of low-density artifacts were found in P-0.3i, P0.0i, and iMAR-applied monochromatic images at 130 keV. The smallest volumes of high-density artifacts were noted in P-0.3i. The CNRs were best in polychromatic images using a weighting factor of 0.4 with or without iMAR application, followed by polychromatic images using a weighting factor of 0.0 with or without iMAR application. Conclusion: Polychromatic images combined with iMAR application, P-0.3i and P0.0i, provided better image qualities and substantial metal artifact reduction compared with other image sets.

Cure Rate Model with Clustered Interval Censored Data (군집화된 구간 중도절단자료에 대한 치유율 모형의 적용)

  • Kim, Yang-Jin
    • The Korean Journal of Applied Statistics
    • /
    • v.27 no.1
    • /
    • pp.21-30
    • /
    • 2014
  • Ordinary survival analysis cannot be applied when a significant fraction of patients may be cured. A cure rate model is the combination of cure fraction and survival model and can be applied to several types of cancer. In this article, the cure rate model is considered in the interval censored data with a cluster effect. A shared frailty model is introduced to characterize the cluster effect and an EM algorithm is used to estimate parameters. A simulation study is done to evaluate the performance of estimates. The proposed approach is applied to the smoking cessation study in which the event of interest is a smoking relapse. Several covariates (including intensive care) are evaluated to be effective for both the occurrence of relapse and the smoke quitting duration.