• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.55-67
• /
• 2008

The user has to subscribe to the library so that user use the library service. User has to register at that in order to use of the nearby another library. Moreover, service such as the inter-library loan and returning my loan book to other library in which the mutual cooperation between the library is needed necessity. But it services due to the constraint condition because of the administrative or technical problems. In this paper excludes the administrative element. The web service model is forming the cluster based on the mutual cooperation between the technologically adjacent public library and provides the technologically necessary single sign-on (SSO) in order to support the additional service. The single sign-on of the library which is concluded by this model using the security information exchange standard (Security Assertion Markup Language : SAML), it is processed by XML base. In using this model, the loan information is confirmed in the attribution in return service library and the model can utilize for the return of loan book in other library. It designs the single sign-on about it.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.3
• /
• pp.67-80
• /
• 2008

Various document categorization methods have been studied to provide a user with an effective way of browsing a large scale of documents. They do compares set of documents into groups of semantically similar documents automatically. However, the automatic categorization method suffers from low accuracy. This thesis proposes a semi-automatic document categorization method based on the domains of documents. Each documents is belongs to its initial domain. All the documents in each domain are recursively clustered in a level-wise manner, so that the category tree of the documents can be founded. To find the clusters of documents, the stop-word of each document is removed on the document frequency of a word in the domain. For each cluster, its cluster keywords are extracted based on the common keywords among the documents, and are used as the category of the domain. Recursively, each cluster is regarded as a specified domain and the same procedure is repeated until it is terminated by a user. In each level of clustering, a user can adjust any incorrectly clustered documents to improve the accuracy of the document categorization.

• The Journal of Society for e-Business Studies
• /
• v.19 no.4
• /
• pp.21-30
• /
• 2014

Personalized data of users at social network service can be used as a new resource for providing personalized nutrition information. Although providing personalized information for nutrition using social data, there are a few studies on providing personalized nutrition information with customized user preference based on social network service. The purpose of this study is to implement the clustering of data analysis with collected personal data of Facebook users. To find out the method for providing personalized information, this study described an effective method for providing nutrition information by analyzing web posting on Facebook that can be called a typical social network service. According to the result from clustering, sodium and sugars were important variables from diet of user. Furthermore, the importance of elements of user's diet has some differences according to vendor/manufactures.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.6
• /
• pp.289-294
• /
• 2016

In recent times, as most people develop keen interest in health management, the importance of cultivating dietary habits to prevent various chronic diseases is emphasized. Subsequently, dietary management systems using a variety of mobile and web application interfaces have emerged. However, these systems are difficult to apply in real world and also do not provide personalized information reflective of the user's situation. Hence it is necessary to develop a personalized dietary management and recommendation method that considers user's body state information, food analysis and other essential statistics. In this paper, we analyze nutrition using self-organizing map (SOM) and prepare data about nutrition using clustering. We provide a substitute food recommendation method and also give feedback about the food that user wants to eat based on personalized criteria. The experiment results show that the distance between input food and recommended food of the proposed method is short compared to the recommended food results using general methods and proved that nutritional similar food is recommended.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1644-1649
• /
• 2019

With the rapid development of mobile communication systems, various mobile convergence services are appearing and data traffic is exploding accordingly. Because the number of base stations to support these surging devices is also increasing, from a network provider's point of view, reducing energy consumption through these mobile communication networks is one of the most important issues. Therefore, in this paper, we apply the DBSCAN (density-based spatial clustering of applications with noise) algorithm, one of the representative user-density based clustering algorithms, in order to extract the dense area with user density and apply the thinning process to each extracted sub-network to efficiently control the mode of the base stations. Extensive simulations show that the proposed algorithm has better performance results than the conventional algorithms with respect to area throughput and energy efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.361-367
• /
• 2021

Information search in video streaming services such as YouTube is replacing traditional information search services. To find desired detailed information in such a video, users should repeatedly navigate several points in the video, resulting in a waste of time and network traffic. In this paper, we propose a method to assist users in searching for information in a video by using DBSCAN clustering and LSTM. Our LSTM model is trained with a dataset that consists of user search sequences and their final target points categorized by DBSCAN clustering algorithm. Then, our proposed method utilizes the trained model to suggest an expected category for the user's desired target point based on a partial search sequence that can be collected at the beginning of the search. Our experiment results show that the proposed method successfully finds user destination points with 98% accuracy and 7s of the time difference by average.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.357-359
• /
• 2023

This paper proposes a hybrid recommendation system (RS) model that overcomes the limitations of traditional approaches such as data sparsity, cold start, and scalability by combining collaborative filtering and context-aware techniques. The objective of this model is to enhance the accuracy of recommendations and provide personalized suggestions by leveraging the strengths of collaborative filtering and incorporating user context features to capture their preferences and behavior more effectively. The approach utilizes a novel method that combines contextual attributes with the original user-item rating matrix of CF-based algorithms. Furthermore, we integrate k-mean++ clustering to group users with similar preferences and finally recommend items that have highly rated by other users in the same cluster. The process of partitioning is the use of the rating matrix into clusters based on contextual information offers several advantages. First, it bypasses of the computations over the entire data, reducing runtime and improving scalability. Second, the partitioned clusters hold similar ratings, which can produce greater impacts on each other, leading to more accurate recommendations and providing flexibility in the clustering process. keywords: Context-aware Recommendation, Collaborative Filtering, Kmean++ Clustering.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.339-341
• /
• 2012

This paper presents a method for generating an autonomous activity-based diary in the environment including a personal computer (PC). In order to record a user's various tasks in front of a PC, we consider the contextual information such as current time, opened programs, and user interactions. As one modality for the user interaction, a motion sensor was applied to recognize a user's hand gestures in case that the activity is conducted without interaction between the user and the PC. Moreover, we propose a temporal clustering method to recapitulate the sequential and meaningful activity in the stream of extracted PC usage logs. By combining those two processes, we summarize the user activities in the PC environment.

• Genomics & Informatics
• /
• v.5 no.1
• /
• pp.10-18
• /
• 2007

Numerous studies have reported that genes with similar expression patterns are co-regulated. From gene expression data, we have assumed that genes having similar expression pattern would share similar transcription factor binding sites (TFBSs). These function as the binding regions for transcription factors (TFs) and thereby regulate gene expression. In this context, various analysis tools have been developed. However, they have shortcomings in the combined analysis of expression patterns and significant TFBSs and in the functional analysis of target genes of significantly overrepresented putative regulators. In this study, we present a web-based A Functional Clustering Analysis Tool for Predicted Transcription Regulatory Elements and Gene Ontology Terms (FCAnalyzer). This system integrates microarray clustering data with similar expression patterns, and TFBS data in each cluster. FCAnalyzer is designed to perform two independent clustering procedures. The first process clusters gene expression profiles using the K-means clustering method, and the second process clusters predicted TFBSs in the upstream region of previously clustered genes using the hierarchical biclustering method for simultaneous grouping of genes and samples. This system offers retrieved information for predicted TFBSs in each cluster using $Match^{TM}$ in the TRANSFAC database. We used gene ontology term analysis for functional annotation of genes in the same cluster. We also provide the user with a combinatorial TFBS analysis of TFBS pairs. The enrichment of TFBS analysis and GO term analysis is statistically by the calculation of P values based on Fisher’s exact test, hypergeometric distribution and Bonferroni correction. FCAnalyzer is a web-based, user-friendly functional clustering analysis system that facilitates the transcriptional regulatory analysis of co-expressed genes. This system presents the analyses of clustered genes, significant TFBSs, significantly enriched TFBS combinations, their target genes and TFBS-TF pairs.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.504-510
• /
• 2009

Recently, personalized-adaptive services became the center of interest in the world. However the services about music are not widely diffused out. That is because the analyzing of music information is more difficult than analyzing of text information. In this paper, we propose a music recommendation system which provides personalized services. The system keeps a user's listening list and analyzes it to select pieces of music similar to the user's preference. For analysis, the system extracts properties from the sound wave of music and the time when the user listens to music. Based on the properties, a piece of music is mapped into a point in the property space and the time is converted into the weight of the point. At this time, if we select and analyze the group which is selected by user frequently, we can understand user's taste. However, it is not easy to predict how many groups are formed. To solve this problem, we apply the K-means clustering algorithm to the weighted points. We modified the K-means algorithm so that the number of clusters is dynamically changed. This manner limits a diameter so that we can apply this algorithm effectively when we know the range of data. By this algorithm we can find the center of each group and recommend the similar music with the group. We also consider the time when music is released. When recommending, the system selects pieces of music which is close to and released contemporarily with the user's preference. We perform experiments with one hundred pieces of music. The result shows that our proposed algorithm is effective.