• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.119-140
• /
• 2007

Recommender systems enable a user to decide which information is interesting and valuable in our world of information overload. As the recent studies of distributed computing environment have been progressing actively, recommender systems, most of which were centralized, have changed toward a peer-to-peer approach. Collaborative Filtering (CF), one of the most successful technologies in recommender systems, presents several limitations, namely sparsity, scalability, cold start, and the shilling problem, in spite of its popularity. The move from centralized systems to distributed approaches can partially improve the issues; distrust of recommendation and abuses of personal information. However, distributed systems can be vulnerable to attackers, who may inject biased profiles to force systems to adapt their objectives. In this paper, we consider both effective CF in P2P environment in order to improve overall performance of system and efficient solution of the problems related to abuses of personal data and attacks of malicious users. To deal with these issues, we propose a multi-agent framework for a distributed CF focusing on the trust relationships between individuals, i.e. web of trust. We employ an agent-based approach to improve the efficiency of distributed computing and propagate trust information among users with effect. The experimental evaluation shows that the proposed method brings significant improvement in terms of the distributed computing of similarity model building and the robustness of system against malicious attacks. Finally, we are planning to study trust propagation mechanisms by taking trust decay problem into consideration.

• Journal of Digital Convergence
• /
• v.14 no.9
• /
• pp.229-239
• /
• 2016

The aim of this paper is to extend the TOPSIS(Technique for Order Performance by Similarity to Ideal Solution) to the fuzzy environment for solving the new professor selection problem in a university. In order to achieve the goal, the rating of each candidate and the weight of each criterion are described by linguistic terms which can be expressed in trapezoidal fuzzy numbers. In this paper, a vertex method is proposed to calculate the distance between two trapezoidal fuzzy numbers. According to the concept of the TOPSIS, a closeness coefficient is defined to determine the ranking order of all candidates. This research derived; 1) 4 evaluation criteria(research results, education and research competency, personality, major suitability) for new professor selection, 2) the 5 step procedure of the proposed fuzzy TOPSIS method for the group decision, 3) priorities of 4 candidates in the new professor selection case. The results of this paper will be useful to practical expert who is interested in analyzing fuzzy data and its multi-criteria decision-making tool for personal selection problem in personal management. Finally, the theoretical and practical implications of the findings were discussed and the directions for future research were suggested.

• Journal of Internet Computing and Services
• /
• v.25 no.4
• /
• pp.23-37
• /
• 2024

Digital twin is an M&S (Modeling and Simulation) technology designed to solve or optimize problems in the real world by replicating physical objects in the real world as virtual objects in the digital world and predicting phenomena that may occur in the future through simulation. Digital twins have been elaborately designed and utilized based on data collected to achieve specific purposes in large-scale environments such as cities and industrial facilities. In order to apply this digital twin technology to real life and expand it into user-customized service technology, practical but sensitive issues such as personal information protection and personalization of simulations must be resolved. To solve this problem, this paper proposes a federated learning-based accelerated client training method (FACTS) for personalized digital twins. The basic approach is to use a cluster-driven federated learning training procedure to protect personal information while simultaneously selecting a training model similar to the user and training it adaptively. As a result of experiments under various statistically heterogeneous conditions, FACTS was found to be superior to the existing FL method in terms of training speed and resource efficiency.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.2
• /
• pp.67-73
• /
• 2005

Recently, the social requirement of personal identification techniques has been increasing. Fingerprint recognition is one of the biometries methods that has been widely used for this requirement. This paper proposes the fingerprint matching algorithm that uses the information of the ridge shapes of minutiae. In which, the data of the ridge shape are expressed in one-dimensional discrete-time signals. In our algorithm, we obtain one-dimensional discrete-time signals for ridge at every minutiae from input and registered fingerprints, and find pairs of minutia which have the similar ridge shape by comparing input fingerprint with registered fingerprint, thereafter we find candidates of rotation angle and moving displacement from the pairs of similar minutia, and obtain the final rotation angle and moving displacement value from those candidates set by using clustering method. After that, we align an input fingerprint by using obtained data, and calculate the matching rate by counting the number of corresponded pairs of minutia within the overlapped area of an input and registered fingerprints. As a result of experiment, false rejection rate(FRR) of $18.0\%$ at false acceptance rate(FAR) of $0.79\%$ is achieved.

• The Journal of the Korea Contents Association
• /
• v.20 no.4
• /
• pp.658-672
• /
• 2020

The purpose of this study is to empirically compare statistical models for pre-service teachers' help networks. We identified similarities and differences based on the results of the binary and valued ERGM. Research questions are as follows: First, what are the similarities of factors influencing the binary/valued help network for pre-service teachers? Second, what are differences of factors influencing the binary/valued help network for pre-service teachers? We measured 42 pre-service teachers with focus on their help and friend networks, happiness, and personal characteristics. Results indicated that, first, the similar factors influencing the binary and valued help network of pre-service teachers were local dependencies (reciprocity, transitivity), similarity (major, gender), activity (early childhood education, negative emotion), popularity (early childhood education) and multiplicity (friend network). Second, the difference between factors affecting pre-service teacher's binary and valued help network was the effect of activity (physical education) and popularity (GPA, negative emotion). Based on these findings, we presented implications.

• KIISE Transactions on Computing Practices
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2018

Recently, there are increasing damages by ransomware in the world. Ransomware is a malicious software that infects computer systems and restricts user's access to them by locking the system or encrypting user's files saved in the hard drive. Victims are forced to pay the 'ransom' to recover from the damage and regain access to their personal files. Strong countermeasure is needed due to the extremely vicious way of attack with enormous damage. Malware analysis method can be divided into two approaches: static analysis and dynamic analysis. Recent malwares are usually equipped with elaborate packing techniques which are main obstacles for static analysis of malware. Therefore, this paper suggests a dynamic analysis method to monitor activities of ransomware. The proposed method can analyze ransomwares more accurately. The suggested method is comprised of extracting signatures of benign program, malware, and ransomware, and selecting the most appropriate signatures for ransomware detection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1721-1737
• /
• 2020

Human apparent age estimation has become a popular research topic and attracted great attention in recent years due to its wide applications, such as personal security and law enforcement. To achieve the goal of age estimation, a large number of methods have been pro-posed, where the models derived through the cumulative attribute coding achieve promised performance by preserving the neighbor-similarity of ages. However, these methods afore-mentioned ignore the geometric structure of extracted facial features. Indeed, the geometric structure of data greatly affects the accuracy of prediction. To this end, we propose an age estimation algorithm through joint feature selection and manifold learning paradigms, so-called Feature-selected and Geometry-preserved Least Square Regression (FGLSR). Based on this, our proposed method, compared with the others, not only preserves the geometry structures within facial representations, but also selects the discriminative features. Moreover, a deep learning extension based FGLSR is proposed later, namely Feature selected and Geometry preserved Neural Network (FGNN). Finally, related experiments are conducted on Morph2 and FG-Net datasets for FGLSR and on Morph2 datasets for FGNN. Experimental results testify our method achieve the best performances.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.711-716
• /
• 2006

Since the introduction of digital camera to the mass market, the number of digital photos owned by an individual is growing at an alarming rate. This phenomenon naturally leads to the issues of difficulties while searching and browsing in the personal digital photo archive. Traditional approach typically involves content-based image retrieval using computer vision algorithms. However, due to the performance limitations of these algorithms, at least on the casual digital photos taken by non-professional photographers, more recent approaches are centered on time-based clustering algorithms, analyzing the shot times of photos. These time-based clustering algorithms are based on the insight that when these photos are clustered according to the shot-time similarity, we have "event clusters" that will help the user browse through her photo archive. It is also reported that one of the remaining problems with the time-based approach is that people perceive events in different scales. In this paper, we present an adaptive time-based clustering algorithm that exploits the usage history of digital photos in order to infer the user's preference on the event granularity. Experiments show significant performance improvements in the clustering accuracy.

• Archives of design research
• /
• v.18 no.2 s.60
• /
• pp.211-218
• /
• 2005

As digital Information equipment is new arrival, new paradigm such as 'function exist but form don't' is needed in the field of design. Therefore, the activity of design is focused on the relationship of human and machine against visual form. For that reason, it is involved emotional factor in the relationship and studied on new field, the emotional interlace. The goal of this paper is to suggest the way of emotional interface on searching multimedia data. The main target of paper is effect sound and human's step and the main way of research is visualization after measuring and analyzing numerically similarity level among emotion-words. This paper suggests the theoretical bad(ground such as personal opinion, the character of auditory information and human's step and case studies on the emotion research. The experimental content about sound is fueled from my previous research and the main experimental content about human's step is made with regression-expression to substitute Quantification method 1 for value about stimulation. The realistic prototype to apply the research result will is suggested on the next research after studying the search environment.

• KIISE Transactions on Computing Practices
• /
• v.22 no.6
• /
• pp.290-295
• /
• 2016

Recently, folksonomy-based image-sharing sites where users cooperatively make and utilize tags of image annotation have been gaining popularity. Typically, these sites retrieve images for a user request using simple text-based matching and display retrieved images in the form of photo stream. However, these tags are personal and subjective and images are not categorized, which results in poor retrieval accuracy and low user satisfaction. In this paper, we propose a categorization scheme for folksonomy images which can improve the retrieval accuracy in the tag-based image retrieval systems. Consequently, images are classified by the semantic similarity using text-information and image-information generated on the folksonomy. To evaluate the performance of our proposed scheme, we collect folksonomy images and categorize them using text features and image features. And then, we compare its retrieval accuracy with that of existing systems.