• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.391-394
• /
• 2009

정보의 양이 폭발적으로 증가함에 따라 웹 사용자가 원하는 적합한 데이터를 찾아내는 것은 매우 어렵다. 이는 웹 사용자마다 서로 다른 검색의도와 질의의 모호성에 의한 것으로, 이와 같은 검색의 어려움을 해결하기 위해 많은 연구들이 수행되어 왔다. 질의 로그는 검색자의 검색 의도가 내포되어 있는 중요한 자료이다. 따라서 웹 사용자별 질의 로그 패턴을 분석하여 유사한 질의를 사용하는 웹 사용자들을 클러스터링 하여 검색에 적용한다면 좀 더 유용한 정보를 획득할 수 있다. 즉, 특정 카테고리와 연관된 질의를 자주 사용하는 웹 사용자들은 해당 분야에 관심이 많을 것이며, 또한 다른 카테고리에 관심이 높은 사람보다 상호간에 소셜지수가 높게 나타날 것이다. 특정 주제에 대해 검색을 할 경우 해당 분야에 관심이 높은 웹 사용자들의 질의 및 클릭한 URL 정보를 상속받을 수 있다면 찾고자 하는 정보에 보다 빨리 접근할 수 있다. 따라서 본 연구는 질의패턴 분석을 통해 카테고리별로 관심도가 높은 웹 사용자들을 클러스터링 한 후 해당 카테고리에 대한 정보 검색시 이들이 사용한 질의와 클릭한 URL 정보를 웹 사용자들에게 제공해줌으로써 정보검색의 편의성을 향상시키기 위한 방안을 제안한다.

• Management & Information Systems Review
• /
• v.36 no.3
• /
• pp.131-150
• /
• 2017

The purpose of this study is to observe the spread pattern of open source software (OSS) while establishing relations with surrounding actors during its operation period. In order to investigate the change pattern of participants in the OSS, we use a netnography on the basis of online data, which can trace the change patterns of the OSS depending on the passage of time. For this, the cases of three OSSs (e.g. jQuery, MooTools, and YUI), which are JavaScript frameworks, were compared, and the corresponding data were collected from the open application programming interface (API) of GitHub as well as blog and web searches. This research utilizes the translation process of the actor-network theory to categorize the stages of the change patterns on the OSS translation process. In the project commencement stage, we identified the type of three different OSS-related actors and defined associated relationships among them. The period, when a master commences a project at first, is refined through the course for the maintenance of source codes with persons concerned (i.e. project growth stage). Thereafter, the period when the users have gone through the observation and learning period by being exposed to promotion activities and codes usage respectively, and becoming to active participants, is regarded as the 'leap of participants' stage. Our results emphasize the importance of promotion processes in participants' selection of the OSS for participation and confirm the crowding-out effect that the rapid speed of OSS development retarded the emergence of participants.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.179-192
• /
• 2007

This paper addresses an approach that recommends investment types for stock investors by discovering useful rules from past changing patterns of stock prices in databases. First, we define a new rule model for recommending stock investment types. For a frequent pattern of stock prices, if its subsequent stock prices are matched to a condition of an investor, the model recommends a corresponding investment type for this stock. The frequent pattern is regarded as a rule head, and the subsequent part a rule body. We observed that the conditions on rule bodies are quite different depending on dispositions of investors while rule heads are independent of characteristics of investors in most cases. With this observation, we propose a new method that discovers and stores only the rule heads rather than the whole rules in a rule discovery process. This allows investors to define various conditions on rule bodies flexibly, and also improves the performance of a rule discovery process by reducing the number of rules. For efficient discovery and matching of rules, we propose methods for discovering frequent patterns, constructing a frequent pattern base, and indexing them. We also suggest a method that finds the rules matched to a query issued by an investor from a frequent pattern base, and a method that recommends an investment type using the rules. Finally, we verify the superiority of our approach via various experiments using real-life stock data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.1
• /
• pp.29-48
• /
• 2014

The recent keyword advertising does not reflect the individual customer searching pattern because it is focused on each keyword at the aggregate level. The purpose of this research is to observe processes of customer searching patterns. To be specific, individual deal-proneness is mainly concerned. This study incorporates location as a control variable. This paper examines the relationship between customers' searching patterns and probability of purchase. A customer searching session, which is the collection of sequence of keyword queries, is utilized as the unit of analysis. The degree of deal-proneness is measured using customer behavior which is revealed by customer searching keywords in the session. Deal-proneness measuring function calculates the discount of deal prone keyword leverage in accordance with customer searching order. Location searching specificity function is also calculated by the same logic. The analyzed data is narrowed down to the customer query session which has more than two keyword queries. The number of the data is 218,305 by session, which is derived from Internet advertising agency's (COMAS) advertisement managing data and the travel business advertisement revenue data from advertiser's. As a research result, there are three types of the deal-prone customer. At first, there is an unconditional active deal-proneness customer. It is the customer who has lower deal-proneness which means that he/she utilizes deal-prone keywords in the last phase. He/she starts searching a keyword like general ones and then finally purchased appropriate products by utilizing deal-prone keywords in the last time. Those two types of customers have the similar rates of purchase. However, the last type of the customer has middle deal-proneness; who utilizes deal-prone keywords in the middle of the process. This type of a customer closely gets into the information by employing deal-prone keywords but he/she could not find out appropriate alternative then would modify other keywords to look for other alternatives. That is the reason why the purchase probability in this case would be decreased Also, this research confirmed that there is a loyalty effect using location searching specificity. The customer who has higher trip loyalty for specificity location responds to selected promotion rather than general promotion. So, this customer has a lower probability to purchase.

• Journal of The Korean Association of Information Education
• /
• v.9 no.1
• /
• pp.79-86
• /
• 2005

With the rapid advance of computer and communication technology, the amount of data transferred is also increasing more than ever. The recent trend of education systems is connecting related information semantically in different systems in order to improve the utilization of computerized information Therefore, Web-based teaching-learning is developing in the ubiquitous learning direction that learners select and organize the contents, time and order of learning by themselves. That is, it is evolving to provide teaching-learning environment adaptive to individual learners' characteristics (their level of knowledge, pattern of study, areas of interest). This paper proposes the efficient evaluation method of learning contents in a mediator for the integration of heterogeneous information resources. This means that the autonomy of a remote server can be preserved to the highest degree. In addition, this paper proposes the adaptive optimization of learning contents such that available storage in a mediator can be highly utilized at any time. In order to differentiate the recent usage of a learning content from the past, the accumulated usage frequency of a learning content decays as time goes by.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.5
• /
• pp.439-444
• /
• 2016

This paper proposes the technique to protect the privacy of those who uses Smart Tourism Service based on location. The proposed privacy protection technique (1) generates a shared private key, OTK(One Time Key) without information exchanging Users with a Tourism Server and provides Users and a Tourism Server with message confidentiality by encrypting data with the key, (2) concatenates users' ID, login time(timestamp), and randomly-generated nonce, generates OTK by hashing with a hash function, encrypts users' location information and query by using the operation of OTK and XOR and provides Users and a Tourism Server with message confidentiality by sending the encrypted result. (3) protects a message replay attack by adding OTK and timestamp. Therefore, this paper not only provides data confidentiality and users' privacy protection but also guarantees the safety of location information and behavior pattern data.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.247-258
• /
• 2005

Protein structure is highly related to its function and comparing protein structure is very important to identify structural motif, family and their function. In this paper, we construct an integrated database system which has all the protein structure data and their literature. The structure queries from the web interface are compared with the target structures in database, and the results are shown to the user for future analysis. To constructs this system, we analyze the Flat-File of Protein Data Bank. Then we select the necessary structure data and store as a new formatted data. The literature data related to these structures are stored in a relational database to query the my kinds of data easily In our structure comparison system, the structure of matched pattern and RMSD valure are calculated, then they are showed to the user with their relational documentation data. This system provides the more quick comparison and nice analyzing environment.

• Journal of IKEEE
• /
• v.14 no.3
• /
• pp.224-231
• /
• 2010

Automatic detection of objects in images has been one of core challenges in the areas such as computer vision and pattern analysis. Especially, with the recent deployment of personal mobile devices such as smart phone, such technology is required to be transported to them. Usually, these smart phone users are equipped with devices such as camera, GPS, and gyroscope and provide various services through user-friendly interface. However, the smart phones fail to give excellent performance due to limited system resources. In this paper, we propose a new scheme to improve object recognition performance based on pre-computation and simple local features. In the pre-processing, we first find several representative parts from similar type objects and classify them. In addition, we extract features from each classified part and train them using regression functions. For a given query image, we first find candidate representative parts and compare them with trained information to recognize objects. Through experiments, we have shown that our proposed scheme can achieve resonable performance.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.99-106
• /
• 2015

This research is focused on the development of the proprietary database embedded in the OTT device, which is used for searching and indexing video contents, and also the development of the search algorithm in the form of the critical components of the interface application with the OTT's database to provide video query searching, such as remote control smartphone application. As the number of available channels has increased to anywhere from dozens to hundreds of channels, it has become increasingly difficult for the viewer to find programs they want to watch. To address this issue, content providers are now in need of methods to recommend programs catering to each viewer's preference. the present study aims provide of the algorithm which recommends contents of OTT program by analyzing personal watching pattern based on one's history.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.575-588
• /
• 2012

Exploiting unlabeled text data with a relatively small labeled corpus has been an active and challenging research topic in text mining, due to the recent growth of the amount of biomedical literature. Biomedical named-entity recognition is an essential prerequisite task before effective text mining of biomedical literature can begin. This paper proposes an Active Co-Training (ACT) algorithm for biomedical named-entity recognition. ACT is a semi-supervised learning method in which two classifiers based on two different feature sets iteratively learn from informative examples that have been queried from the unlabeled data. We design a new classification problem to measure the informativeness of an example in unlabeled data. In this classification problem, the examples are classified based on a joint view of a feature set to be informative/non-informative to both classifiers. To form the training data for the classification problem, we adopt a query-by-committee method. Therefore, in the ACT, both classifiers are considered to be one committee, which is used on the labeled data to give the informativeness label to each example. The ACT method outperforms the traditional co-training algorithm in terms of f-measure as well as the number of training iterations performed to build a good classification model. The proposed method tends to efficiently exploit a large amount of unlabeled data by selecting a small number of examples having not only useful information but also a comprehensive pattern.