• Asia Marketing Journal
• /
• v.17 no.4
• /
• pp.89-104
• /
• 2016

Based on the observation that insurance companies in Korea, unlike those in other financial sectors and those in other countries, dominantly use the agent-based push-type marketing strategy, this paper hypothesizes that difference in distribution systems originating from characteristics of financial products can lead to welfare asymmetry between financial institutions and customers, merely due to their financial matching. For this analysis, we employ a simple matching theoretic model, try to understand the welfare implications of distribution systems from a matching theoretic perspective, and analyze the bottom of negative perceptions of insurance industry. The proposed model suggests that this welfare asymmetry derives mainly from financial matching through the distribution systems, which implies that any efforts to improve the insurance industry must consider changes in the matching process, namely the distribution system. We hope that this paper complements and extends the existing literature on insurance distribution systems in terms of methodologies and research subjects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.343-364
• /
• 2021

In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.187-194
• /
• 1999

Case-Based Reasoning(CBR) systems support ill structured decision-making. The measure of the success of a CBR system depends on its ability to retrieve the most relevant previous cases in support of the solution of a new case. One of the methodologies widely used in existing CBR systems to retrieve previous cases is that of the Nearest Neighbor(NN) matching function. The NN matching function is based on assumptions of the independence of attributes in previous case and the availability of rules and procedures for matching.(omitted)

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.421-424
• /
• 2000

In this paper, we propose a window warping method to solve stereo matching problems in projective distortion region. Because the projective distortion region cant t be estimated with fixed-size block matching algorithm, we use the window warping technique in block matching process. The position of a reference window to resample is obtained adaptively according to the degree of reliability in disparity estimated previously. The initial disparity and reliability are obtained by applying a well known hierarchical strategy. The experimental result shows that considerable improvement is obtained in the projective distortion region.

• International journal of advanced smart convergence
• /
• v.11 no.3
• /
• pp.132-141
• /
• 2022

We look at the rocket life stages of NaverZ's metaverse platform scaling and investigate the ignition and scale-up stage of its metaverse platform brand, Zepeto based on the Rocket Model (RM). The results are derived as follows: Firstly, NaverZ shows the event strategy by collaborating with K-pops, the piggybacking strategy by utilizing other SNSs, and the VIP strategy by investing in game and entertainment content genres in the 'attract' function. In the second 'match' function, based on the matching rule of Zepeto, the users can generate their own characters and "World" with Zepeto Studio. However, for strengthening the matching quality, NaverZ is investing in the artificial intelligence (AI) based companies consistently. In the 'connect' function, NaverZ's maximization of the positive interaction is possible by inducing feed activities in Zepeto & other SNSs and by uploading attractive content for viral effects in the ignition. For facilitating this, NaverZ expands the scale to other continents like Southeast Asia and Middle East with the localization strategy inclusive investment. Lastly, in the 'transact' function, based on three monetization experiments like Coin & ZEM, user generated content (UGC) fee, and advertising revenue in the ignition, NaverZ starts to invest in NFT platforms and abroad blockchain companies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1546-1564
• /
• 2012

Pattern-based query processing has not attracted much attention in wireless sensor network though its counterpart has been studied extensively in data stream. The methods used for data stream usually consume large memory and much energy. This conflicts with the fact that wireless sensor networks are heavily constrained by their hardware resources. In this paper, we use piece wise representation to represent sensor nodes' collected data to save sensor nodes' memory and to reduce the energy consumption for query. After getting data stream's and patterns' approximated line segments, we record each line's slope. We do similar matching on slope sequences. We compute the dynamic time warping distance between slope sequences. If the distance is less than user defined threshold, we say that the subsequence is similar to the pattern. We do experiments on STM32W108 processor to evaluate our strategy's performance compared with naive method. The results show that our strategy's matching precision is less than that of naive method, but our method's energy consumption is much better than that of naive approach. The strategy proposed in this paper can be used in wireless sensor network to process pattern-based queries.

• Journal of Service Research and Studies
• /
• v.3 no.1
• /
• pp.55-73
• /
• 2013

The purpose of this research is to find a solution for matching service between recruiting and job seeking of software developers. An efficient matching service solution is essential for acquiring solid global competitiveness in software industry and IT academia. An in-depth analysis on deep-rooted problems on mismatching has been performed. Past and present policies on mismatching solutions have been reviewed based on desirable co-growth structure. A new matching solution has been derived and a triple-helix strategy has been suggested. A survey result for 14 domain experts and 85 employees of large and small software companies shows that the suggested matching solution is useful. The results of this research can be used for finding a better matching service solution and policies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.1
• /
• pp.55-63
• /
• 1998

This paper presents a new maching algorithm by Hopfield Neural Network for 3-D object recognition. In the proposed method, a model object is represented by a set of polygons in a single coordinate. And each polygon is described by a set of features; feature attributes. In case of 3-D object recognition, the scale and poses of the object are important factors. So we propose a strategy for 3-D object recognition independently to its scale and poses. In this strategy, the respective features of the input or the model objects are changed to the startegical constants when they are compared with one another. Finally, we show that the proposed method has a robustness through the results of experiments which included the classification of the input objects and the matching sequence to its 3-D rotation and scale.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.11a
• /
• pp.141-146
• /
• 2005

Ensemble method has been known as one of the most powerful classification tools that can improve prediction accuracy. Ensemble method also has been understood as ‘perturb and combine’ strategy. Many studies have tried to develop ensemble methods by improving perturbation. In this paper, we propose two new ensemble methods that improve combining, based on the idea of pattern matching. In the experiment with simulation data and with real dataset, the proposed ensemble methods peformed better than bagging. The proposed ensemble methods give the most accurate prediction when the pruned tree was used as the base learner.