• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.65-73
• /
• 2007

This study devotes to compare the accuracy of Top-N recommendations of items transacted on the web site for customers with the accuracy of rank conformity of the real ratings with estimated ratings for customers preference about items generated from two types of collaborative filtering algorithms. One is Neighborhood Based Collaborative Filtering Algorithm(NBCFA) and the other is Correspondence Mean Algorithm(CMA). The result of this study shows the accuracy of Top-N recommendations and the rank conformity of real ratings with estimated ratings generated by CMA are better than that of NBCFA. It would be expected that the customer's satisfaction in Recommender System is more improved by using the prediction result from CMA than NBCFA, and then Using CMA in collaborative filtering recommender system is more efficient than using NBCFA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.872-885
• /
• 2015

The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.107-110
• /
• 2002

현재까지 개발된 화자식별 시스템 중 가중모델순위(Weighting Model Rank; WMR)방법을 이용한 화자인식 시스템이 비교적 높은 인식성능을 나타내고 있다. WMR 방법은 각 화자에 대한 프레임 유사도의 순위에 따라 지수함수 가중치로 대치시키는 방법을 사용하고 있으나, 이 방법은 유사도 본래의 변별력이 전체 계산에서 고려되지 않는 문제가 있었다. 이를 해결하기 위해 본 논문에서는 각 화자의 프레임 유사도와 지수함수를 이용한 가중치를 곱한 값을 이용하여 전체 스코어를 계산하도록 하는 수정된 가중모델 순위방법(Modified Weighting Model Rank; MWMR)을 제안한다. 제안한 방법의 유효성을 확인하기 위하여 316명의 화자를 대상으로 하여 인식실험을 실시한 결과, 학습 프레임이 10,000일 경우, MWMR 방법에서 $98.1\%$의 화자 인식률을 얻어 WMR 방법에 비해 약 $2.0\%$의 향상된 인식결과를 보여 제안한 방법의 유효성을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1163-1185
• /
• 2024

With the sharp increase in the volume of literature data, researchers must spend considerable time and energy locating desired papers. A paper recommendation is the means necessary to solve this problem. Unfortunately, the large amount of data combined with sparsity makes personalizing papers challenging. Traditional matrix decomposition models have cold-start issues. Most overlook the importance of information and fail to consider the introduction of noise when using side information, resulting in unsatisfactory recommendations. This study proposes a paper recommendation method (PR-SLSMF) using document-level representation learning with citation-informed transformers (SPECTER) and low-rank and sparse matrix factorization; it uses SPECTER to learn paper content representation. The model calculates the similarity between papers and constructs a weighted heterogeneous information network (HIN), including citation and content similarity information. This method combines the LSMF method with HIN, effectively alleviating data sparsity and cold-start issues and avoiding topic drift. We validated the effectiveness of this method on two real datasets and the necessity of adding side information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1189-1204
• /
• 2018

Detecting and capturing 3D human structures from the intensity-based image sequences is an inherently arguable problem, which attracted attention of several researchers especially in real-time activity recognition (Real-AR). These Real-AR systems have been significantly enhanced by using depth intensity sensors that gives maximum information, in spite of the fact that conventional Real-AR systems are using RGB video sensors. This study proposed a depth-based routine-logging Real-AR system to identify the daily human activity routines and to make these surroundings an intelligent living space. Our real-time routine-logging Real-AR system is categorized into two categories. The data collection with the use of a depth camera, feature extraction based on joint information and training/recognition of each activity. In-addition, the recognition mechanism locates, and pinpoints the learned activities and induces routine-logs. The evaluation applied on the depth datasets (self-annotated and MSRAction3D datasets) demonstrated that proposed system can achieve better recognition rates and robust as compare to state-of-the-art methods. Our Real-AR should be feasibly accessible and permanently used in behavior monitoring applications, humanoid-robot systems and e-medical therapy systems.

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.11
• /
• pp.549-556
• /
• 2020

Real estate markets play an essential role in the economic development of both developed and developing countries. Investment decisions in private real estate demand the consideration of several qualitative and quantitative criteria. Especially in Vietnam, demand for housing, apartments are rising which has resulted because of the migration from rural to urban areas. This study aims to determine the influencing factors of the real estate purchasing behavior and then recommend a grey Multi-Criteria Decision Making (MCDM) support model to evaluate real estate alternatives based on a numerical example in Vietnam. A set of essential criteria are identified based on experts' opinion, and the proposed determinants are initial investment, maintenance cost, prestige location, distance to interesting places, parking lot, public transportation, property condition, total area size, number of rooms, and neighbors. The subjective weights were obtained by using the Decision-Making Trial and Evaluation Laboratory (DEMATEL) model, and the Grey Relational Analysis (GRA) technique is employed to prioritize and rank real estate alternatives. The results reveal that this approach can be useful to make purchasing decisions for many kinds of real estate property under uncertain business environments. These findings indicate that the presented hybrid model has advantages in granting flexibility to the preferences of decision makers.

• ETRI Journal
• /
• v.38 no.4
• /
• pp.714-723
• /
• 2016

Considerable attention has been given to processing graph data in recent years. An efficient method for computing the node proximity is one of the most challenging problems for many applications such as recommendation systems and social networks. Regarding large-scale, mutable datasets and user queries, top-k query processing has gained significant interest. This paper presents a novel method to find top-k answers in a node proximity search based on the well-known measure, Personalized PageRank (PPR). First, we introduce a distribution state transition graph (DSTG) to depict iterative steps for solving the PPR equation. Second, we propose a weight distribution model of a DSTG to capture the states of intermediate PPR scores and their distribution. Using a DSTG, we can selectively follow and compare multiple random paths with different lengths to find the most promising nodes. Moreover, we prove that the results of our method are equivalent to the PPR results. Comparative performance studies using two real datasets clearly show that our method is practical and accurate.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.1
• /
• pp.47-55
• /
• 2000

In this paper, a vision-based roadway detection algorithm for an automated vehicle control system, based on roadway sign information on roads, is proposed. First, in order to detect roadway signs, the color scene image is enhanced under hue-invariance. Fuzzy logic is employed to simplify the enhanced color image into a binary image and the binary image is morphologically filtered. Then, an effective algorithm of locating signs based on binary rank order transform (BROT) is utilized to extract signs from the image. This algorithm performs better than those previously presented. Finally, the inner shapes of roadway signs with curving roadway direction information are recognized by neural networks. Experimental results show that the new detection algorithm is simple and robust, and performs well on real sign detection. The results also show that the neural networks used can exactly recognize the inner shapes of signs even for very noisy shapes.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.04a
• /
• pp.197-201
• /
• 2004

We describe a new edge detector based on the robust rank-order (RRO) test which is a useful alternative to Wilcoxon test, using $r{\times}r$ window for detecting edges of all possible orientations in noisy images. Some experiments of statistical edge detectors based on the Wilcoxon test and T test with our RRO detector are carried out on synthetic and real images corrupted by both Gaussian and impulse noise. We also implement these edge detectors using Java on the Web.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.2
• /
• pp.475-486
• /
• 2015

Mining the microarray data accumulated in the public data repositories can save experimental cost and time and provide valuable biomedical information. Big data analysis pooling multiple data sets increases statistical power, improves the reliability of the results, and reduces the specific bias of the individual study. However, integrating several data sets from different studies is needed to deal with many problems. In this study, I limited the focus to the cross platform classification that the platform of a testing sample is different from the platform of a training set, and suggested a simple classification method based on rank. This method is compared with the diagonal linear discriminant analysis, k nearest neighbor method and support vector machine using the cross platform real example data sets of two cancers.