• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.1-10
• /
• 2006

In document clustering methods, the k-means algorithm and the Hierarchical Alglomerative Clustering(HAC) are often used. The k-means algorithm has the advantage of a processing time and HAC has also the advantage of a precision of classification. But both methods have mutual drawbacks, a slow processing time and a low quality of classification for the k-means algorithm and the HAC, respectively. Also both methods have the serious problem which is to compute a document similarity whenever new document is inserted into a cluster. A main property of web resource is to accumulate an information by adding new documents frequently. Therefore, we propose a new method of transitive closure tree based on the HAC method which can improve a processing time for a document clustering, and also propose a superior incremental clustering method for an insertion of a new document and a deletion of a document contained in a cluster. The proposed method is compared with those existing algorithms on the basis of a pre챠sion, a recall, a F-Measure, and a processing time and we present the experimental results.

• Transactions of Materials Processing
• /
• v.18 no.7
• /
• pp.513-518
• /
• 2009

Large load is required in forging of large-scale components which becomes a critical restriction in practice. In the present study, two methods of incremental forging were investigated for the purpose of reducing the load required for forging of large and thick plates. The forging was applied primarily to obtain fine grains by imposing large amount of plastic deformation to the plates. One was to use nine strokes with a flat die and the other was to use three strokes with a curved die. The die moves vertically in the former while it moves vertically as well as rolls horizontally in the latter. Deformation of the slab in each case was analyzed by rigid-plastic finite element method and as a result, variations of load and slab holding force, and distributions of effective strain and thickness were predicted.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2496-2511
• /
• 2014

Face recognition is considered a complex biometrics in the field of image processing mainly due to the constraints imposed by variation in the appearance of facial images. These variations in appearance are affected by differences in expressions and/or occlusions (sunglasses, scarf etc.). This paper discusses incremental Kernel Fisher Discriminate Analysis on sub-classes for dealing with partial occlusions and variant expressions. This framework focuses on the division of classes into fixed size sub-classes for effective feature extraction. For this purpose, it modifies the traditional Linear Discriminant Analysis into incremental approach in the kernel space. Experiments are performed on AR, ORL, Yale B and MIT-CBCL face databases. The results show a significant improvement in face recognition.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.1343-1344
• /
• 2015

본 연구에서는 증분형 FCM(Incremental Fuzzy C-Means: Incremental FCM) 클러스터링 알고리즘을 기반으로 방사형 기저함수 신경회로망(Radial Basis Function Neural Networks: RBFNN) 패턴 분류기를 설계한다. 방사형 기저함수 신경회로망은 조건부에서 가우시안 함수 또는 FCM을 사용하여 적합도를 구하였지만, 제안된 분류기에서는 빅 데이터간의 적합도를 구하기 위해 증분형 FCM을 사용한다. 또한, 빅 데이터를 학습하기 위해 결론부에서 재귀최소자승법(Recursive Least Square Estimation: RLSE)을 사용하여 다항식 계수를 추정한다. 마지막으로 추론부에서는 증분형 FCM에서 구한 적합도와 재귀최소자승법으로 구한 다항식을 이용하여 최종 출력을 구한다.

• Transactions of Materials Processing
• /
• v.20 no.4
• /
• pp.279-283
• /
• 2011

Recently incremental sheet metal forming (ISF) has used widely in making prototypes and small-volume products in automotive industry etc. We apply the ISF to make a 1/4 sized automobile body-in-white. First, ISF tests for rectangular shaped cup have been performed to clarify the formability denoting the relationship between the component wall angle and maximum cup height of safe forming. Next, a CAD model for the automobile was designed and segmented into several components in order to accommodate the working space of the CNC machine we adopted and the formability of the sheet metal. Then, a CAM software was employed to generate the tool path for manufacturing wooden dies and all the small parts. Finally, the different parts were joined into a single component by laser welding after the ISF process. By using the ISF we successfully produced the 1/4 sized automobile body-in-white.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.986-988
• /
• 1995

The ART(Adaptive Resonance Theory) model is self- organized with nonstationary input patterns in real time. But there is a multirun problem caused by fault clustering, or pertubated clustering and confines the advantage of the stationary real-time processing in ART model. In this paper, we propose the incremental vigilance threshold approach to decrease the number of multiruns. The incremental vigilance threshold approach is to learn with incremental vigilance threshold and competition with clusters.

• Transactions of Materials Processing
• /
• v.30 no.1
• /
• pp.27-34
• /
• 2021

In this study, response surface method (RSM) was used in modeling and multi-objective optimization of the parameters of AA5052-H32 in incremental sheet forming (ISF). The goals of optimization were the maximum forming angle, minimum thickness reduction, and minimum surface roughness, with varying values in response to changes in production process parameters, such as tool diameter, tool spindle speed, step depth, and tool feed rate. A Box-Behnken experimental design (BBD) was used to develop an RSM model for modeling the variations in the forming angle, thickness reduction, and surface roughness in response to variations in process parameters. Subsequently, the RSM model was used as the fitness function for multi-objective optimization of the ISF process based on experimental design. The results showed that RSM can be effectively used to control the forming angle, thickness reduction, and surface roughness.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.1
• /
• pp.1-14
• /
• 2020

Antenna selection is a method to enhance the performance of spatial multiplexing multiple-input multiple-output (MIMO) systems, which can achieve the diversity order of the full MIMO systems. Although various selection criteria have been studied in the literature, they should be adjusted to the detection operation implemented at the receiver. In this paper, antenna selection methods that optimize the post-processing signal-to-noise ratio (SNR) and eigenvalue are considered for the lattice reduction (LR)-based receiver. To develop a complexity-efficient antenna selection algorithm, the incremental selection strategy is adopted. Moreover, for improvement of performance, an additional iterative selection method is presented in combination with an incremental strategy.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1395-1409
• /
• 2006

A spatial data warehouse has spatial data cube composed of multi-dimensional data for efficient OLAP(On-Line Analytical Processing) operations. A spatial data cube supporting concept hierarchies holds huge amount of data so that many researches have studied a incremental update method for minimum modification of a spatial data cube. The Cube, however, compressed by eliminating prefix and suffix redundancy has coalescing paths that cause update inconsistencies for some updates can affect the aggregate value of coalesced cell that has no relationship with the update. In this paper, we propose incremental batch update method of a spatial data cube. The proposed method uses duplicated nodes and extended node structure to avoid update inconsistencies. If any collision is detected during update procedure, the shared node is duplicated and the duplicate is updated. As a result, compressed spatial data cube that includes concept hierarchies can be updated incrementally with no inconsistency. In performance evaluation, we show the proposed method is more efficient than other naive update methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.23-26
• /
• 2006

기존의 데이터 마이닝 예측 기법 중 회귀분석은 학습 단계에서 생성된 모델을 변경 없이 새로운 데이터에 적용하였다. 그러나 시계열 데이터에 모델 변경 없이 동일하게 적용하면 시간이 지남에 따라 정확도가 낮아지는 단점이 있다. 따라서 이 논문에서는 시간에 따라 변화하는 시계열데이터의 특성을 고려하여 점진적으로 회귀 모델을 갱신하는 기법을 제안한다. 이 기법은 입력되는 모든 데이터를 회귀 모델에 적용하여 점진적으로 모델을 갱신한다. 제안된 기법의 타당성은 RME(Relative Mean Error)와 RMSE(Root Mean Square Error)를 이용하여 측정하였다. 정확도 측정 실험 결과 제안 기법인 IMQR(Incremental Multiple Quadratic Regression) 기법이 MLR(Multiple Linear Regression), MQR(Multiple Quadratic Regression), SVR(Support Vector Regression) 기법에 비해 RME 가 평균 2%, RMSE 가 평균 0.02 정도 우수한 결과를 얻었다.