• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.210-216
• /
• 2006

In the rule based modeling, data partitioning plays crucial role be cause partitioned sub data set implies particular information of the given data set or system. In this paper, we present an empirical study result of the data pattern estimation to find underlying data patterns of the given data. Presented method performs crisp type clustering with given n number of data samples by means of the sequential agglomerative hierarchical nested model (SAHN). In each sequence, the average value of the sum of all inter-distance between centroid and data point. In the sequel, compute the derivation of the weighted average distance to observe a pattern distribution. For the final step, after overall clustering process is completed, weighted average distance value is applied to estimate range of the number of clusters in given dataset. The proposed estimation method and its result are considered with the use of FCM demo data set in MATLAB fuzzy logic toolbox and Box and Jenkins's gas furnace data.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.9
• /
• pp.1-9
• /
• 2011

In this paper, we propose an efficient method to create clusters of geographically distributed base stations which cooperatively transmit signals in cellular mobile communication systems. The proposed method utilizes a sequential selection approach to choose candidate base stations which can provide maximum weighted sum-rate gain when they participate in the cooperative transmission with the existing cluster. In particular, the proposed method limits the maximum number of base stations in a cluster by considering the system operational and implementation complexities. Moreover, the combinations of clusters dynamically change along with variations of channel environments. Through computer simulations, performance of the proposed method is verified by comparing with the non-cooperative transmission method and the static clustering method. Numerical result shows that the proposed sequential selection based clustering method is especially advantageous for the performance improvement of lower percentile users in terms of average throughput, and thus the proposed method can effectively improve the fairness among users.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.1027-1038
• /
• 2006

There are many technical problems in the recommendation system based on very large database(VLDB). So, it is necessary to study the recommendation system' structure and the data-mining technique suitable for the large scale Internet shopping mail. Thus we design and implement the product recommendation system using k-means clustering algorithm and sequential pattern technique which can be used in large scale Internet shopping mall. This paper processes user information by batch processing, defines the various categories by hierarchical structure, and uses a sequential pattern mining technique for the search engine. For predictive modeling and experiment, we use the real data(user's interest and preference of given category) extracted from log file of the major Internet shopping mall in Korea during 30 days. And we define PRP(Predictive Recommend Precision), PRR(Predictive Recommend Recall), and PF1(Predictive Factor One-measure) for evaluation. In the result of experiments, the best recommendation time and the best learning time of our system are much as O(N) and the values of measures are very excellent.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.101-107
• /
• 2014

This paper presents an efficient distributed recommendation system using clustering collaborative filtering algorithm in distributed computing environments. The system was built based on Hadoop distributed computing platform, where distributed Min-hash clustering algorithm is combined with user based collaborative filtering algorithm to optimize recommendation performance. Experiments using Movie Lens benchmark data show that the proposed system can reduce the execution time for recommendation compare to sequential system.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.779-788
• /
• 2002

There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2003.04a
• /
• pp.82-85
• /
• 2003

강원도 춘천시 신북읍 유포리 연구지역의 지하수의 NO$_3$-N 2차원 공간 분포를 정의하기 위하여 지구통계학적 해석 방법인 sequential Gaussian simulation(SGS)을 이용하였다. 원자료의 공간적 clustering을 제거하기 위하여 cell declustering을 수행한 후 normal score 변환을 거친 후 variogram 분석과 모델링을 수행하였다. Exponential, gaussian, spherical variogram model에 대한 각각의 nugget, range, sill을 정의하여 SGS에 이용하였다. SGS에 의해 도출된 결과들은 모두 동일한 결과를 나타낸다. 또한 관측 자료의 분포와 주 오염원의 분포와 상응하는 모델링 결과를 나타내는 것으로 보아 SGS를 이용한 농촌지역 지하수내 NO$_3$-N의 공간적 오염 분포 영상화가 매우 유용하게 활용될 수 있을 것으로 판단된다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.348-353
• /
• 1989

화학공정 비정상상태 모사에 있어서 계산상 불리한 특성인 불연속성과 stiff한 성질에 대처할 수 있도록 sequential-clustered구조를 기본으로 하는 모사기에 불연속 처리 루틴을, 구현하였고, stiff성질의 완화를 위해 공정의 동특성 차이에 기인하는 latency를 이용하여 적절한 clustering기법으로 cluster크기를 결정하는 pre-processor를 개발하였다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.616-620
• /
• 2010

Generally, most people use the photo management method which clusters lots of photos into each folders according to photo shooting time and date. However, since the number of photos to manage is getting more increasing, it takes much time and burdensome work. This paper describes PHOTOLAND, a system that visualizes hundreds of photos on a 2D grid space to help users manage their photos. It closely places similar photos in the grid based on temporal and spatial information. Most photograph management systems use a scrollable view based on a sequential grid layout that arranges the thumbnails of photos in some default order on the screen. Our system decreases drag and drop mouse interaction when they classify their photos into small groups comparing to the sequential grid layout. We conducted experiments to evaluate temporal coherence and space efficiency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.2
• /
• pp.193-200
• /
• 2022

Unknown cryptographic communication protocols may have advantage of guaranteeing personal and data privacy, but when used for malicious purposes, it is almost impossible to identify and respond to using existing network security equipment. In particular, there is a limit to manually analyzing a huge amount of traffic in real time. Therefore, in this paper, we attempt to identify packets of unknown cryptographic communication protocols and separate fields comprising a packet by using machine learning techniques. Using sequential patterns analysis, hierarchical clustering, and Pearson's correlation coefficient, we found that the structure of packets can be automatically analyzed even for an unknown cryptographic communication protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.456-457
• /
• 2021

Recently, in order to more accurately provide indoor location-based services, technologies using Wi-Fi fingerprints and deep learning are being studied. Among the deep learning models, an RNN model that can store information from the past can store continuous movements in indoor positioning, thereby reducing positioning errors. When using an RNN model for indoor positioning, the collected training data must be continuous sequential data. However, the Wi-Fi fingerprint data collected to determine specific location information cannot be used as training data for an RNN model because only RSSI for a specific location is recorded. This paper proposes a region clustering technique for sequential input data generation of RNN models based on Wi-Fi fingerprint data.