Digital Library[ Search Result ]
A Group Modeling Strategy Considering Deviation of the User’s Preference in Group Recommendation
HyungJin Kim, Young-Duk Seo, Doo-Kwon Baik
Group recommendation analyzes the characteristics and tendency of a group rather than an individual and provides relevant information for the members of the group. Existing group recommendation methods merely consider the average and frequency of a preference. However, if the users’ preferences have large deviations, it is difficult to provide satisfactory results for all users in the group, although the average and frequency values are high. To solve these problems, we propose a method that considers not only the average of a preference but also the deviation. The proposed method provides recommendations with high average values and low deviations for the preference, so it reflects the tendency of all group members better than existing group recommendation methods. Through a comparative experiment, we prove that the proposed method has better performance than existing methods, and verify that it has high performance in groups with a large number of members as well as in small groups.
Tweet Entity Linking Method based on User Similarity for Entity Disambiguation
SeoHyun Kim, YoungDuk Seo, Doo-Kwon Baik
Web based entity linking cannot be applied in tweet entity linking because twitter documents are shorter in comparison to web documents. Therefore, tweet entity linking uses the information of users or groups. However, data sparseness problem is occurred due to the users with the inadequate number of twitter experience data; in addition, a negative impact on the accuracy of the linking result for users is possible when using the information of unrelated groups. To solve the data sparseness problem, we consider three features including the meanings from single tweets, the users’ own tweet set and the sets of other users’ tweets. Furthermore, we improve the performance and the accuracy of the tweet entity linking by assigning a weight to the information of users with a high similarity. Through a comparative experiment using actual twitter data, we verify that the proposed tweet entity linking has higher performance and accuracy than existing methods, and has a correlation with solving the data sparseness problem and improved linking accuracy for use of information of high similarity users.
A Binary Decision Diagram-based Modeling Rule for Object-Relational Transformation Methodology
Sooyoung Cha, Sukhoon Lee, Doo-Kwon Baik
In order to design a system, software developers use an object model such as the UML class diagram. Object-Relational Transformation Methodology (ORTM) is a methodology to transform the relationships that are expressed in the object model into relational database tables, and it is applied for the implementation of the designed system. Previous ORTM studies have suggested a number of transformation methods to represent one relationship. However, there is an implementation problem that is difficult to apply because the usage criteria for each transformation method do not exist. Therefore, this paper proposes a binary decision diagram-based modeling rule for each relationship. Hence, we define the conditions for distinguishing the transformation methods. By measuring the query execution time, we also evaluate the modeling rules that are required for the verification. After evaluation, we re-define the final modeling rules which are represented by propositional logic, and show that our proposed modeling rules are useful for the implementation of the designed system through a case study.
A Design of Metadata Registry Database based on Object-Relational Transformation Methodology
Sooyoung Cha, Sukhoon Lee, Dongwon Jeong, Doo-Kwon Baik
The ISO/IEC 11179 Metadata registry (MDR) is an international standard that was developed to register and share metadata. ISO/IEC 11179 represents an MDR as a metamodel that is an object model. However, it is difficult to develop an MDR based on ISO/IEC 11179 because the standard has no clear criteria to transform the metamodel into a database. In this paper, we suggest the design of an MDR data model that is based on object-relational transformation methodology (ORTM) for the MDR implementation. Hence, we classify the transformation methods of ORTM according to the corresponding relationships. After classification, we propose modeling rules by defining the standard use of the transformation. This paper builds the relational database tables as an implementation result of an MDR data model. Through experiments and evaluation, we verify the proposed modeling rules and evaluate the suitability of the created table structures. As the result, the proposed method shows that the table structures preserve classes and relationships of the standard metamodel well.
An Elementary-Function-Based Refinement Method for Use Cases to Improve Reliability of Use Case Points
Ryoung Heo, Young-Duk Seo, Doo-Kwon Baik
Use The Use Case Points method is a software estimation method that is based on user requirements. When requirement analysts elicit user requirements, they obtain different use cases because different levels of detail are possible for the Use Case, and this affects the Use Case Points. In this paper, we suggest a method to refine the level of detail of the Use Case by using the concept of an elementary function. This refinement method achieves the desired reliability for the Use Case Points because it produces less of a deviation in the Use Case Points for different requirement analysts than other methods that are based on the step, transaction, and narrative of the Use Case.
A Path Fragment Management Structure for Fast Projection Candidate Selection of the Path Prediction Algorithm
Dongwon Jeong, Sukhoon Lee, Doo-Kwon Baik
This paper proposes an enhanced projection candidate selection algorithm to improve the performance of the existing path prediction algorithm. Various user path prediction algorithms have previously been developed, but those algorithms are inappropriate for a real-time and close user path prediction environment. To resolve this issue, a new prediction algorithm has been proposed, but several problems still remain. In particular, this algorithm should be enhanced to provide much faster processing performance. The major cause of the high processing time of the previous path prediction algorithm is the high time complexity of its projection candidate selection. Therefore, this paper proposes a new path fragment management structure and an improved projection candidate selection algorithm to improve the processing speed of the existing projection candidate selection algorithm. This paper also shows the effectiveness of the algorithm herein proposed through a comparative performance evaluation.
An Evaluation Method for Contents Importance Based on Twitter Characteristics
Euijong Lee, Jeong-Dong Kim, Doo-Kwon Baik
Twitter is a social network service that generates about 140 million contents a day. Contents of Twitter contain a variety of information and many researchers research those in various fields. In this research, we propose a method for evaluating the importance of content based on characteristics of Twitter. We have found that number of follower means user’s popularity and Re-tweet that means the popularity of content. We perform experiments about proposed method using real Twitter data for proving effectiveness of proposed method. Also, we found information providers in Twitter are public user who represent a company or a representative of a specific group.
Search
Journal of KIISE
- ISSN : 2383-630X(Print)
- ISSN : 2383-6296(Electronic)
- KCI Accredited Journal
Editorial Office
- Tel. +82-2-588-9240
- Fax. +82-2-521-1352
- E-mail. chwoo@kiise.or.kr