• Title/Summary/Keyword: Recommended Algorithm

Search Result 271, Processing Time 0.029 seconds

Target Market Determination for Information Distribution and Student Recruitment Using an Extended RFM Model with Spatial Analysis

  • ERNAWATI, ERNAWATI;BAHARIN, Safiza Suhana Kamal;KASMIN, Fauziah
    • Journal of Distribution Science
    • /
    • v.20 no.6
    • /
    • pp.1-10
    • /
    • 2022
  • Purpose: This research proposes a new modified Recency-Frequency-Monetary (RFM) model by extending the model with spatial analysis for supporting decision-makers in discovering the promotional target market. Research design, data and methodology: This quantitative research utilizes data-mining techniques and the RFM model to cluster a university's provider schools. The RFM model was modified by adapting its variables to the university's marketing context and adding a district's potential (D) variable based on heatmap analysis using Geographic Information System (GIS) and K-means clustering. The K-prototype algorithm and the Elbow method were applied to find provider school clusters using the proposed RFM-D model. After profiling the clusters, the target segment was assigned. The model was validated using empirical data from an Indonesian university, and its performance was compared to the Customer Lifetime Value (CLV)-based RFM utilizing accuracy, precision, recall, and F1-score metrics. Results: This research identified five clusters. The target segment was chosen from the highest-value and high-value clusters that comprised 17.80% of provider schools but can contribute 75.77% of students. Conclusions: The proposed model recommended more targeted schools in higher-potential districts and predicted the target segment with 0.99 accuracies, outperforming the CLV-based model. The empirical findings help university management determine the promotion location and allocate resources for promotional information distribution and student recruitment.

A Text Mining-based Intrusion Log Recommendation in Digital Forensics (디지털 포렌식에서 텍스트 마이닝 기반 침입 흔적 로그 추천)

  • Ko, Sujeong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.6
    • /
    • pp.279-290
    • /
    • 2013
  • In digital forensics log files have been stored as a form of large data for the purpose of tracing users' past behaviors. It is difficult for investigators to manually analysis the large log data without clues. In this paper, we propose a text mining technique for extracting intrusion logs from a large log set to recommend reliable evidences to investigators. In the training stage, the proposed method extracts intrusion association words from a training log set by using Apriori algorithm after preprocessing and the probability of intrusion for association words are computed by combining support and confidence. Robinson's method of computing confidences for filtering spam mails is applied to extracting intrusion logs in the proposed method. As the results, the association word knowledge base is constructed by including the weights of the probability of intrusion for association words to improve the accuracy. In the test stage, the probability of intrusion logs and the probability of normal logs in a test log set are computed by Fisher's inverse chi-square classification algorithm based on the association word knowledge base respectively and intrusion logs are extracted from combining the results. Then, the intrusion logs are recommended to investigators. The proposed method uses a training method of clearly analyzing the meaning of data from an unstructured large log data. As the results, it complements the problem of reduction in accuracy caused by data ambiguity. In addition, the proposed method recommends intrusion logs by using Fisher's inverse chi-square classification algorithm. So, it reduces the rate of false positive(FP) and decreases in laborious effort to extract evidences manually.

Improvement of F-GCRA Algorithm for ATM-GFR Service (ATM-GFR 서비스를 위한 F-GCRA 알고리즘 개선)

  • Park, In-Yong
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.889-896
    • /
    • 2006
  • ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.

Evaluation of Applicability of Impulse function-based Algorithm for Modification of Ground Motion to Match Target Response Spectrum (Impulse 함수 기반 목표응답스펙트럼 맞춤형 지진파 보정 알고리즘의 적용성 평가)

  • Kim, Hyun-Kwan;Park, Duhee
    • Journal of the Korean GEO-environmental Society
    • /
    • v.12 no.4
    • /
    • pp.53-63
    • /
    • 2011
  • Selection or generation of appropriate input ground motion is very important in performing a dynamic analysis. In Korea, it is a common practice to use recorded strong ground motions or artificial motions. The recorded motions show non-stationary characteristics, which is a distinct property of all earthquake motions, but have the problem of not matching the design response spectrum. The artificial motions match the design spectrum, but show stationary characteristics. This study generated ground motions that preserve the non-stationary characteristics of a real earthquake motion, but also matches the design spectrum. In the process, an impulse function-based algorithm that adjusts a given time series in time domain such that it matches the target response spectrum is used. Application of the algorithm showed that it can successfully adjust any recorded motions to match the target spectrum and also preserve the non-stationary characteristics. The modified motions are used to perform a series of nonlinear site response analyses. It is shown that the results using the adjusted motions result in more reliable estimates of ground vibration. It is thus recommended that the newly adjusted motions be used in practice instead of original recorded motions.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

Automatic Recommendation of Nearby Tourist Attractions related to Events (이벤트와 관련된 주변 관광지 자동 추천 알고리즘 개발)

  • Ahn, Jinhyun;Im, Dong-Hyuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.3
    • /
    • pp.407-413
    • /
    • 2020
  • Participating in exhibitions is one of the major activities for tourists. When selecting their next travel destination after participating in an event, they use map services and social network services, such as blogs, to obtain information about tourist attractions. The map services are location-based recommendations, because they can easily retrieve information regarding nearby places. Blogs contain informative content about tourist attractions, thereby providing content-based recommendations. However, few services consider both location and content. In location-based recommendations, tourist attractions that are not related to the content of the event attended might be recommended. Content-based recommendation has a disadvantage in that events located at a distance might get recommended. We propose an algorithm that considers both location and content, based on information from the Korea Tourism Organization's Linked Open Data (LOD), Wikipedia, and a Korean dictionary. By extracting nouns from the description of a tourist attraction and then comparing them with nouns about other attractions, a content-based relationship is determined. The distance to the event is calculated based on the latitude and longitude of each tourist attraction. A weight selected by the user is used for linear combination with the content-based relationship to determine the preference order of the recommendations.

Development and Evaluation of Safe Route Service of Electric Personal Assistive Mobility Devices for the Mobility Impaired People (교통약자를 위한 전동 이동 보조기기 안전 경로 서비스의 개발과 평가)

  • Je-Seung WOO;Sun-Gi HONG;Sang-Kyoung YOO;Hoe Kyoung KIM
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.26 no.3
    • /
    • pp.85-96
    • /
    • 2023
  • This study developed and evaluated a safe route guidance service for electric personal assistive mobility device used mainly by the mobility impaired people to improve their mobility. Thirteen underlying factors affecting the mobility of electric personal assistive mobility device have been derived through a survey with the mobility impaired people and employees in related organizations in Busan Metropolitan City. After assigning safety scores to individual factors and identifying the relevant factors along routes of interest with an object detection AI model, the safe route for electric personal assistive mobility device was provided through an optimal path-finding algorithm. As a result of comparing the general route of T-map and the recommended route of this study for the identical routes, the latter had relatively fewer obstacles and the gentler slope than the former, implicating that the recommended route is safer than the general one. As future works, it is necessary to enhance the function of a route guidance service based on the real-time location of users and to conduct spot investigations to evaluate and verify its social acceptability.

A Study on the Dose Assessment Methodology Using the Probabilistic Characteristics of TL Element Response (확률분포 특성을 이용한 열형광선량계의 선량평가방법에 관한 연구)

  • Cho, Dae-Hyung;Oh, Jang-Jin;Han, Seung-Jae;Na, Seong-Ho;Hwang, Won-Guk;Lee, Won-Keun
    • Journal of Radiation Protection and Research
    • /
    • v.23 no.3
    • /
    • pp.123-138
    • /
    • 1998
  • Characteristics of element responses of Panasonic UD802 personnel dosimeters in the X, ${\beta}$, ${\gamma}$, ${\gamma}/X$, ${\gamma}/{\beta}$ and ${\gamma}$/neutron mixed fields were assessed. A dose-response algorithm has been developed to decide the high probability of a radiation type and energy by using the distribution in all six ratios of the multi-element TLD. To calculate the 4-element response factors and ratios between the elements of the Panasonic TLDs in the X, $\beta$, and $\gamma$ radiation fields, Panasonic’s UD802 TLDs were irradiated with KINS’s reference irradiation facility. In the photon radiation field, this study confirms that element-3 (E3) and element-4 (E4) of the Panasonic TLDs show energy dependent both in low- and intermediate-energy range, while element-1 (E1) and element-2 (E2) show little energy dependency in the entire whole range. The algorithm, which was developed in this study, was applied to the Panasonic personnel dosimetry system with UD716AGL reader and UD802 TLDs. Performance tests of the algorithm developed was conducted according to the standards and criteria recommended in the ANSI N13.11. The sum of biases and standard deviations was less than 0.232. The values of biases and standard deviations are distributed within a triangle of a lateral value of 0.3 in the ordinate and abscissa, With the above algorithm, Panasonic TLDs satisfactorily perform optimum dose assessment even under an abnormal response of the TLD elements to the energy imparted. This algorithm can be applied to a more rigorous dose assessment by distinguishing an unexpected dose from the planned dose for the most practical purposes, and is useful in conducting an effective personnel dose control program.

  • PDF

Regionalization of CN Parameters for Nakdong River Basin using SCE-UA Algorithm (SCE-UA 최적화기법에 의한 낙동강 유역의 CN값 도출)

  • Jeon, Ji-Hong;Choi, Dong Hyuk;Kim, Jung-Jin;Kim, Tae Dong
    • Journal of Korean Society on Water Environment
    • /
    • v.25 no.2
    • /
    • pp.245-255
    • /
    • 2009
  • CN values are changed by various surface condition, which is cover type or treatment, hydrologic condition, or percent impervious area, even the same combination of land use and hydrologic soil group. In this study, CN parameters were regionalized for Nakdong River Basin by Long-Term Hydrologic Impact Assessment (L-THIA) coupled with SCE-UA, which is one of the global optimization technique. Six watersheds were selected for calibration (optimization) and periodic validation and two watersheds for spatical validation as ungauged watershed within Nakdong River Basin. Nash-Sutcliffe (NS) values were 0.66~0.86 for calibration, 0.68~0.91 for validation, and 0.60 and 0.85 for ungauged watersheds, respectively. Urban area for the selected watersheds covered high impervious area with 85% for residential area and 92% for commercial/industrial/transportation area. Hydrologic characteristics for crop area was similar to row crop with contoured treatment and poor hydrologic condition. For the forested area, hydrologic characteristics could be clearly distinguished from the leaf types of plant. Deciduous, coniferous, and mixed forest showed low, moderate, and high runoff rates by representing wood with fair and poor hydrologic condition, and wood-grass combination with fair hydrologic condition, respectively. CN parameters from this study could be strongly recommended to be used to simulate runoff for ungauged watershed.

Comparing String Similarity Algorithms for Recognizing Task Names Found in Construction Documents (문자열 유사도 알고리즘을 이용한 공종명 인식의 자연어처리 연구 - 공종명 문자열 유사도 알고리즘의 비교 -)

  • Jeong, Sangwon;Jeong, Kichang
    • Korean Journal of Construction Engineering and Management
    • /
    • v.21 no.6
    • /
    • pp.125-134
    • /
    • 2020
  • Natural language encountered in construction documents largely deviates from those that are recommended by the authorities. Such practice that is lacking in coherence will discourage integrated research with automation, and it will hurt the productivity in the industry for the long run. This research aims to compare multiple string similarity (string matching) algorithms to compare each algorithm's performance in recognizing the same task name written in multiple different ways. We also aim to start a debate on how prevalent the aforementioned deviation is. Finally, we composed a small dataset that associates construction task names found in practice with the corresponding task names that are less cluttered w.r.t their formatting. We expect that this dataset can be used to validate future natural language processing approaches.