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

The Category Fluency Test (CFT) is a widely used verbal fluency test. The standard measure of scoring the test is the number of distinct words that a subject generates during the test. Recently, other measures have also been proposed to evaluate performance, such as clustering and switching. In this study, we examine clusters and switches can be assessed using word similarity measures. Based on these measures, we can distinguish between subject groups.

• Industrial Engineering and Management Systems
• /
• v.14 no.3
• /
• pp.236-247
• /
• 2015

This study aims to examine the effects of industrial clustering and manufacturing flexibility on innovation capability and operational performance. This study follow a survey method to collect data pertaining to the phenomena of industrial clustering, manufacturing flexibility, innovation capability, and operational performance by utilizing a single respondent design. A total of 124 Indonesian manufacturing SMEs are taken to test the proposed theoretical model by utilizing covariance-based structural equations modeling approach. It was found that both industrial clustering and manufacturing flexibility was positively associated with operational performance and innovation capability as well. In addition, innovation capability may account for the effects of industrial clustering and manufacturing flexibility on operational performance. This implies that manufacturing SMEs have to reorient their production and operation perspectives, including agglomerate with other similar or related SMEs to develop and utilize their own resources. The SMEs also need to possess some degree of manufacturing flexibility in respond to the uncertain environment and market changes. In addition, the SMEs should put a greater emphasize to use industrial cluster and manufacturing flexibility benefits to generate innovation capability to achieve high performance.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.1
• /
• pp.82-82
• /
• 2010

We measure the topology of the galaxy distribution using the Seventh Data Release of the Sloan Digital Sky Survey (SDSS DR7), examining the dependence of galaxy clustering topology on galaxy properties. The observational results are used to test galaxy formation models. A volume-limited sample defined by Mr<-20.19 enables us to measure the genus curve with amplitude of G=378 at 6h-1Mpc smoothing scale, with 4.8% uncertainty including all systematics and cosmic variance. The clustering topology over the smoothing length interval from 6 to 10h-1Mpc reveals a mild scale-dependence for the shift and void abundance (A_V) parameters of the genus curve. We find strong bias in the topology of galaxy clustering with respect to the predicted topology of the matter distribution, which is also scale-dependent. The luminosity dependence of galaxy clustering topology discovered by Park et al. (2005) is confirmed: the distribution of relatively brighter galaxies shows a greater prevalence of isolated clusters and more percolated voids. We find that galaxy clustering topology depends also on morphology and color. Even though early (late)-type galaxies show topology similar to that of red (blue) galaxies, the morphology dependence of topology is not identical to the color dependence. In particular, the void abundance parameter A_V depends on morphology more strongly than on color. We test five galaxy assignment schemes applied to cosmological N-body simulations to generate mock galaxies: the Halo-Galaxy one-to-one Correspondence (HGC) model, the Halo Occupation Distribution (HOD) model, and three implementations of Semi-Analytic Models (SAMs). None of the models reproduces all aspects of the observed clustering topology; the deviations vary from one model to another but include statistically significant discrepancies in the abundance of isolated voids or isolated clusters and the amplitude and overall shift of the genus curve. SAM predictions of the topology color-dependence are usually correct in sign but incorrect in magnitude.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.421-426
• /
• 2006

We propose a new algorithm for K-medoids clustering which runs like the K-means clustering algorithm and test several methods for selecting initial medoids. The proposed algorithm calculates similarity matrix once and uses it for finding new medoids at every iterative step. To evaluate the proposed algorithm we use real and artificial data and compare with the clustering results of other algorithms in terms of three performance measures. Experimental results show that the proposed algorithm takes the reduced time in computation with comparable performance as compared to the Partitioning Around Medoids.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.143-145
• /
• 2005

In this paper, an empirical study result on pattern estimation method is devoted to reveal underlying data patterns with a relatively reduced computational cost. Presented method performs crisp type clustering with given n number of data samples by means of the sequential agglomerative hierarchical nested model (SAHN). Conventional SAHN based clustering requires large computation time in the initial step of algorithm. To deal with this concern, we modified overall process with a partial approach. In the beginning of this method, we divide given data set to several sub groups with uniform sampling and then each divided sub data group is applied to SAHN based method. The advantage of this method reduces computation time of original process and gives similar results. Proposed is applied to several test data set and simulation result with conceptual analysis is presented.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.5
• /
• pp.269-277
• /
• 2000

We propose two new types multi-stage blind clustering equalizers for QAM demoulation, which are called a complex classification algorithm(CCA) and a radial basis function algorithm(RBFA). The CCA uses a clustering technique based on the joint gaussian probability function and computes separately the real part and imaginary part for simple implementation as well as less computation. In order to improve the performance of CCA, the Dual-Mode CCA(DMCCA) incorporates the CCA tap-updating mode with the decision-directed(DD) mode. The RBFA reduces the number of cluster centers through three steps using the classification technique of RBF and then updates the equalizer taps for QAM demodulation. Test results on 16-QAM confirm that the proposed algorithms perform better the conventional multi-state equalizers in the senses of SER and MSE under multi-path fading channel.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.2
• /
• pp.146-159
• /
• 2023

This paper proposes a hybrid algorithm combining K-means clustering and watershed algorithms for flower segmentation and counting. We use the K-means clustering algorithm to obtain the main colors in a complex background according to the cluster centers and then take a color space transformation to extract pixel values for the hue, saturation, and value of flower color. Next, we apply the threshold segmentation technique to segment flowers precisely and obtain the binary image of flowers. Based on this, we take the Euclidean distance transformation to obtain the distance map and apply it to find the local maxima of the connected components. Afterward, the proposed algorithm adaptively determines a minimum distance between each peak and apply it to label connected components using the watershed segmentation with eight-connectivity. On a dataset of 30 images, the test results reveal that the proposed method is more efficient and precise for the counting of overlapped flowers ignoring the degree of overlap, number of overlap, and relatively irregular shape.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.23 no.4
• /
• pp.765-771
• /
• 2009

The medical informatics for clustering Sasang types with collected clinical data is important for the personalized medicine, but it has not been thoroughly studied yet. The purpose of this study was to examine the usefulness of neural network data mining algorithm for traditional Korean medicine. We used Kohonen neural network, the Self-Organizing Map (SOM), for the analysis of biomedical information following data pre-processing and calculated the validity index as percentage correctly predicted and type-specific sensitivity. We can extract 12 data fields from 30 after data pre-processing with correlation analysis and latent functional relationship analysis. The profile of Myers-Briggs Type Inidcator and Bio-Impedance Analysis data which are clustered with SOM was similar to that of original measurements. The percentage correctly predicted was 56%, and sensitivity for So-Yang, Tae-Eum and So-Eum type were 56%, 48%, and 61%, respectively. This study showed that the neural network algorithm for clustering Sasang types based on clinical data is useful for the sasang type diagnostic test itself. We discussed the importance of data pre-processing and clustering algorithm for the validity of medical devices in traditional Korean medicine.

• Journal of the Korean Geographical Society
• /
• v.41 no.1 s.112
• /
• pp.121-135
• /
• 2006

Even though the similar land price zone is very important element in the public land appraisal procedure, the concept is implicitly described and applied into the actual land appraisal system. This situation makes it worse when applying for the automatic selection of a comparative standard land parcel. In addition, the division of similar land price zones requires the objective and reasonable process for improving ALPAS(Automatic land Price Appraisal System), which becomes an issue today. To solve the similar land price zone determination problem that is caused by the lack of objective numerical standard, this study proposed a similar land price zone determination method using a hybrid clustering technique. Results showed that this hybrid clustering method that applied into the test area could easily detect similar land price zones with considerable accuracy levels, which are verified with some test statistics and real comparative standard land parcels done by manually.

• Journal of Intelligence and Information Systems
• /
• v.21 no.1
• /
• pp.119-142
• /
• 2015

With the explosive growth in the volume of information, Internet users are experiencing considerable difficulties in obtaining necessary information online. Against this backdrop, ever-greater importance is being placed on a recommender system that provides information catered to user preferences and tastes in an attempt to address issues associated with information overload. To this end, a number of techniques have been proposed, including content-based filtering (CBF), demographic filtering (DF) and collaborative filtering (CF). Among them, CBF and DF require external information and thus cannot be applied to a variety of domains. CF, on the other hand, is widely used since it is relatively free from the domain constraint. The CF technique is broadly classified into memory-based CF, model-based CF and hybrid CF. Model-based CF addresses the drawbacks of CF by considering the Bayesian model, clustering model or dependency network model. This filtering technique not only improves the sparsity and scalability issues but also boosts predictive performance. However, it involves expensive model-building and results in a tradeoff between performance and scalability. Such tradeoff is attributed to reduced coverage, which is a type of sparsity issues. In addition, expensive model-building may lead to performance instability since changes in the domain environment cannot be immediately incorporated into the model due to high costs involved. Cumulative changes in the domain environment that have failed to be reflected eventually undermine system performance. This study incorporates the Markov model of transition probabilities and the concept of fuzzy clustering with CBCF to propose predictive clustering-based CF (PCCF) that solves the issues of reduced coverage and of unstable performance. The method improves performance instability by tracking the changes in user preferences and bridging the gap between the static model and dynamic users. Furthermore, the issue of reduced coverage also improves by expanding the coverage based on transition probabilities and clustering probabilities. The proposed method consists of four processes. First, user preferences are normalized in preference clustering. Second, changes in user preferences are detected from review score entries during preference transition detection. Third, user propensities are normalized using patterns of changes (propensities) in user preferences in propensity clustering. Lastly, the preference prediction model is developed to predict user preferences for items during preference prediction. The proposed method has been validated by testing the robustness of performance instability and scalability-performance tradeoff. The initial test compared and analyzed the performance of individual recommender systems each enabled by IBCF, CBCF, ICFEC and PCCF under an environment where data sparsity had been minimized. The following test adjusted the optimal number of clusters in CBCF, ICFEC and PCCF for a comparative analysis of subsequent changes in the system performance. The test results revealed that the suggested method produced insignificant improvement in performance in comparison with the existing techniques. In addition, it failed to achieve significant improvement in the standard deviation that indicates the degree of data fluctuation. Notwithstanding, it resulted in marked improvement over the existing techniques in terms of range that indicates the level of performance fluctuation. The level of performance fluctuation before and after the model generation improved by 51.31% in the initial test. Then in the following test, there has been 36.05% improvement in the level of performance fluctuation driven by the changes in the number of clusters. This signifies that the proposed method, despite the slight performance improvement, clearly offers better performance stability compared to the existing techniques. Further research on this study will be directed toward enhancing the recommendation performance that failed to demonstrate significant improvement over the existing techniques. The future research will consider the introduction of a high-dimensional parameter-free clustering algorithm or deep learning-based model in order to improve performance in recommendations.