• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.389-390
• /
• 2002

It is important that acquire information about if customer has some habit in electronic commerce application of internet base that led in recommendation service for customer in dynamic web contents supply. Collaborative filtering that has been used as a standard approach to Web personalization can not get rapidly user's preference change due to static user profiles and has shortcomings such as reliance on user ratings, lack of scalability, and poor performance in the high-dimensional data. In order to overcome this drawbacks, Web usage mining has been prevalent. Web usage mining is a technique that discovers patterns from We usage data logged to server. Specially. a technique that discovers Web usage patterns and clusters patterns is used. However, the discovery of patterns using Afriori algorithm creates many useless patterns. In this paper, the enhanced method for the construction of dynamic user profiles using validated Web usage patterns is proposed. First, to discover patterns Apriori is used and in order to create clusters for user profiles, ARHP algorithm is chosen. Before creating clusters using discovered patterns, validation that removes useless patterns by Dempster-Shafer theory is performed. And user profiles are created dynamically based on current user sessions for Web personalization.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.5
• /
• pp.2375-2382
• /
• 2011

The user clustering for web navigation pattern discovery is very useful to get preference and behavior pattern of users for web pages. In addition, the information by the user clustering is very essential for web personalization or customer grouping. In this paper, an algorithm for clustering the web navigation path of users is proposed and then some special navigation patterns can be recognized by the algorithm. The proposed algorithm has two clustering phases. In the first phase, all paths are classified into k-groups on the bases of the their similarities. The initial solution obtained in the first phase is not global optimum but it gives a good and feasible initial solution for the second phase. In the second phase, the first phase solution is improved by revising the k-means algorithm. In the revised K-means algorithm, grouping the paths is performed by the hyperplane instead of the distance between a path and a group center. Experimental results show that the proposed method is more efficient.

• Mass Spectrometry Letters
• /
• v.4 no.4
• /
• pp.59-66
• /
• 2013

A metabolomics study was conducted to identify urinary biomarkers for breast cancer, using gas chromatography-mass spectrometry (GC-MS) and liquid chromatography-mass spectrometry (LC-MS), analyzed by principal components analysis (PCA) as well as a partial least squares-discriminant analysis (PLS-DA) for a metabolic pattern analysis. To find potential biomarkers, urine samples were collected from before- and after-mastectomy of breast cancer patients and healthy controls. Androgens, corticoids, estrogens, nucleosides, and polyols were quantitatively measured and urinary metabolic profiles were constructed through PCA and PLS-DA. The possible biomarkers were discriminated from quantified targeted metabolites with a metabolic pattern analysis and subsequent screening. We identified two biomarkers for breast cancer in urine, ${\beta}$-cortol and 5-methyl-2-deoxycytidine, which were categorized at significant levels in a student t-test (p-value < 0.05). The concentrations of these metabolites in breast cancer patients significantly increased relative to those of controls and patients after mastectomy. Biomarkers identified in this study were highly related to metabolites causing oxidative DNA damage in the endogenous metabolism. These biomarkers are not only useful for diagnostics and patient stratification but can be mapped on a biochemical chart to identify the corresponding enzyme for target identification via metabolomics.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1998-2004
• /
• 2009

Recently, due to technical developments of various storage devices and networks, the amount of data increases rapidly. The large volume of data streams poses unique space and time constraints on the data mining process. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Most of the researches based on the support are concerned with the frequent itemsets, but ignore the infrequent itemsets even if it is crucial. In this paper, we propose an efficient method WSFI-Mine(Weighted Support Frequent Itemsets Mine) to mine all frequent itemsets by one scan from the data stream. This method can discover the closed frequent itemsets using DCT(Data Stream Closed Pattern Tree). We compare the performance of our algorithm with DSM-FI and THUI-Mine, under different minimum supports. As results show that WSFI-Mine not only run significant faster, but also consume less memory.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.175-178
• /
• 2005

스마트 홈과 같은 유비쿼터스 환경은 다양한 센서 및 제어 네트워크가 밀집되어 있는 복잡한 시스템이다. 본 논문에서는 이러한 환경하에서 복잡한 인터페이스의 사용에 대한 사용자의 인지 부담(cognitive load)를 줄이고 개인화된(personalized) 서비스를 자율적으로 제공하기 위한 사용자 행동 패턴 선호도 학습 기법을 제안한다. 이를 위해 지식 발견(Knowledge Discovery)을 위한 평생 학습(life-long learning)의 관점에서 퍼지 귀납(Fuzzy Inductive)학습 방법론을 제안하며, 이것은 수치 데이터로부터 입력 공간에 대한 효율적인 퍼지 분할(fuzzy partition)을 얻어내고 일관성있는(consisitent) 퍼지 상관 룰(fuzzy association rule)을 얻어내도록 한다.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1017-1024
• /
• 2004

Ubiquitous system requires intelligent environment and system that perceives context in a proactive manner. This paper describes proactive retrieval method using context patterns in ubiquitous computing. And as the user's contexts change, new information is delivered proactively based on user's context patterns. For proactive retrieval, we extract context patterns based on sequential pattern discovery and association rule in data mining. By storing only information to be needed in near future using the context patterns, we solved the problem of speed and storage capacity of mobile devices in ubiquitous computing. We explain algorithms and an example. Several experiments are performed and the experimental results show that our method has a good information retrieval.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.147-158
• /
• 2009

Recently, the data model in stream data environment has massive, continuous, and infinity properties. However the stream data processing like query process or data analysis is conducted using a limited capacity of disk or memory. In these environment, the traditional frequent pattern discovery on transaction database can be performed because it is difficult to manage the information continuously whether a continuous stream data is the frequent item or not. In this paper, we propose the method which we are able to predict the frequent items using the regression model on continuous stream data environment. We can use as a prediction model on indefinite items by constructing the regression model on stream data. We will show that the proposed method is able to be efficiently used on stream data environment through a variety of experiments.

• Journal of the Korean Magnetic Resonance Society
• /
• v.20 no.4
• /
• pp.129-137
• /
• 2016

Transmembrane(TM) proteins are closely related to transport, channel formation, signaling, cell to cell interaction, so they are the crucial target of modern medicinal drugs. In order to study the structure and function of these TM proteins, it is important to prepare reasonable amounts of proteins. However, their preparation is seriously difficult and time-consuming due to insufficient yields and low solubility of TM proteins. We tried to produce large amounts of Syndecan-4 containing TM domain(SDC4-TM) that is related to the wound healing and tumor. Also, mutated SDC4-TM was studied to investigate structural change by modification of dimerization motif. We performed the structure determination by the Polarity Index at Slanted Angle (PISA) wheel pattern analysis based on $^{15}N-^1H$ 2D SAMPI-4 solid-state NMR of SDC4-TM and computational modeling using Discovery Studio 2016.

• Journal of Information Technology Applications and Management
• /
• v.26 no.5
• /
• pp.27-39
• /
• 2019

The Internet of Things (IoT) is a new paradigm that is revolutionizing computing. It is intended that all objects around us will be connected to the network, providing "anytime, anywhere" access to information. This study introduces IoT with Kolb's learning style in order to enhance the learning experience especially for inclusive education for primary and secondary schools where delivery of knowledge is not limited to physical, cognitive disabilities, human diversity with respect to ability, language, culture, gender, age and of other forms of human differences. The article also emphasizes the role of learning style as a discovery process that incorporates the characteristics of problem solving and learning. Kolb's Learning Style was chosen as it is widely used in research and in practical information systems applications. A consistent pattern of finding emerges by using a combination of Kolb's learning style and internet of things where specific individual differences, learning approach differences and IoT application differences are taken as a main research framework. Further several suggestions were made by using this combination to IoT architecture and smart environment of internet of things. Based on these suggestions, future research directions are proposed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1034-1051
• /
• 2016

Mobility models are invaluable for determining the performance of routing protocols in opportunistic networks. The movement of nodes has a significant influence on the topological structure and data transmission in networks. In this paper, we propose a new mobility model called the campus-based community mobility model (CBCNM) that closely reflects the daily life pattern of students on a real campus. Consequent on a discovery that the pause time of nodes in their community follows a power law distribution, instead of a classical exponential distribution, we abstract the semi-Markov model from the movement of the campus nodes and analyze its rationality. Then, using the semi-Markov algorithm to switch the movement of the nodes between communities, we infer the steady-state probability of node distribution at random time points. We verified the proposed CBCNM via numerical simulations and compared all the parameters with real data in several aspects, including the nodes' contact and inter-contact times. The results obtained indicate that the CBCNM is highly adaptive to an actual campus scenario. Further, the model is shown to have better data transmission network performance than conventional models under various routing strategies.