• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.185-199
• /
• 2024

In this paper, an improved automated spectral clustering (IASC) algorithm is proposed to address the limitations of the traditional spectral clustering (TSC) algorithm, particularly its inability to automatically determine the number of clusters. Firstly, a cluster number evaluation factor based on the optimal clustering principle is proposed. By iterating through different k values, the value corresponding to the largest evaluation factor was selected as the first-rank number of clusters. Secondly, the IASC algorithm adopts a density-sensitive distance to measure the similarity between the sample points. This rendered a high similarity to the data distributed in the same high-density area. Thirdly, to improve clustering accuracy, the IASC algorithm uses the cosine angle classification method instead of K-means to classify the eigenvectors. Six algorithms-K-means, fuzzy C-means, TSC, EIGENGAP, DBSCAN, and density peak-were compared with the proposed algorithm on six datasets. The results show that the IASC algorithm not only automatically determines the number of clusters but also obtains better clustering accuracy on both synthetic and UCI datasets.

• Journal of agriculture & life science
• /
• v.44 no.4
• /
• pp.69-77
• /
• 2010

Fuzzy control is widely used for improving temperature control performance as controlling ventilation in greenhouse because the technique can respond more flexibly to the outside air temperature and wind speed. By pre-studied PID and normal fuzzy control this study was performed to obtain the fundamental data that can be established in better greenhouse ventilation control method. The temperature control error by the simple fuzzy control was $1.2^{\circ}C$. The accumulated operating size of the window and the number of operating were 84% and 13, respectively. These showed equivalent control performance with pre-studied result that control error. The accumulated operating size of the window and the number of operating were 75% and 12, respectively. The proposed fuzzy technique was simple control logic method compared with step and PID control methods, but it showed equivalent performance. Therefore, the proposed simple fuzzy control method could be used in micro controller of small programmable memory size and many applications.

• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.29-39
• /
• 2006

Sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. A number of routing protocols to transmit the data between the base station and sensor nodes have been proposed. Intanagonwiwat et al. proposed the directed diffusion in which the base station sends interest messages and waits for data from the nodes in the specific regions. Since the directed diffusion propagates every interest message to whole nodes in the network, it causes energy dissipation of nodes. In this paper, we propose a novel data propagation method, which limits the data transmission area according to a threshold value for reducing the energy consumption in the network. A fuzzy logic is exploited to determine the threshold value by considering the energy and density of all the deployed nodes. The simulation models are designed and implemented based on DEVS formalism which is theoretically well grounded means of expressing discrete event simulation models.

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.333-338
• /
• 2001

In this paper, fuzzy-ARTMAP equalizer is developed mainly for overcoming the obstacles, such as complexity and long training, in implementing the previously developed neural-basis equalizers. The proposed fuzzy-ARTMAP equalizer is fast and easy to train and includes capabilities not found in other neural network approaches a small number of parameters, no requirements for the choice of initial weights, no risk of getting trapped in local minima, and capability of adding new data without retraining previously trained data. In simulation studies, binary signals were generated at random from linear channel with Gaussian noise. The performance of the proposed equalizer is compared with other neural net basis equalizers, such as MLP and RBF equalizers. The fuzzy ARTMAP equalizer combines relatively simple structure and fast processing speed; it gives accurate results for nonlinear problems that cannot be solved with a linear equalizer.

• Journal of Korean Society of Transportation
• /
• v.24 no.7 s.93
• /
• pp.81-90
• /
• 2006

It is important to clarify the relationship between traffic accidents and various influencing factors in order to reduce the number of traffic accidents. This study developed a traffic accident frequency prediction model using by multi-linear regression and qualification theories which are commonly applied in the field of traffic safety to verify the influences of various factors into the traffic accident frequency The data were collected on the Korean National Highway 17 which shows the highest accident frequencies and fatality rates in Chonbuk province. In order to minimize the uncertainty of the data, the fuzzy theory and neural network theory were applied. The neural network theory can provide fair learning performance by modeling the human neural system mathematically. Tn conclusion, this study focused on the practicability of the fuzzy reasoning theory and the neural network theory for traffic safety analysis.

• Journal of the Korean Geographical Society
• /
• v.30 no.3
• /
• pp.296-310
• /
• 1995

Classification of spatial units into meaningful sets is an important procedure in spatial analysis. It is crucial in characterizing and identifying spatial structures. But traditional classification methods such as cluster analysis require an exact database and impose a clear-cut boundary between classes. Scrutiny of realistic classification problems, however, reveals that available infermation may be vague and that the boundary may be ambiguous. The weakness of conventional methods is that they fail to capture the fuzzy data and the transition between classes. Fuzzy subsets theory is useful for solving these problems. This paper aims to come to the understanding of theoretical foundations of fuzzy spatial analysis, and to find the characteristics of fuzzy classification methods. It attempts to do so through the literature review and the case study of urban classification of the Cities and Eups of Kyung-Nam Province. The main findings are summarized as follows: 1. Following Dubois and Prade, fuzzy information has an imprecise and/or uncertain evaluation. In geography, fuzzy informations about spatial organization, geographical space perception and human behavior are frequent. But the researcher limits his work to numerical data processing and he does not consider spatial fringe. Fuzzy spatial analysis makes it possible to include the interface of groups in classification. 2. Fuzzy numerical taxonomic method is settled by Deloche, Tranquis, Ponsard and Leung. Depending on the data and the method employed, groups derived may be mutually exclusive or they may overlap to a certain degree. Classification pattern can be derived for each degree of similarity/distance $\alpha$. By takina the values of $\alpha$ in ascending or descending order, the hierarchical classification is obtained. 3. Kyung-Nam Cities and Eups were classified by fuzzy discrete classification, fuzzy conjoint classification and cluster analysis according to the ratio of number of persons employed in industries. As a result, they were divided into several groups which had homogeneous characteristies. Fuzzy discrete classification and cluste-analysis give clear-cut boundary, but fuzzy conjoint classification delimit the edges and cores of urban classification. 4. The results of different methods are varied. But each method contributes to the revealing the transparence of spatial structure. Through the result of three kinds of classification, Chung-mu city which has special characteristics and the group of Industrial cities composed by Changwon, Ulsan, Masan, Chinhai, Kimhai, Yangsan, Ungsang, Changsungpo and Shinhyun are evident in common. Even though the appraisal of the fuzzy classification methods, this framework appears to be more realistic and flexible in preserving information pertinent to urban classification.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.121-125
• /
• 2008

It is essential to maintain hierarchical information properly for efficient XML query processing. Well known approach to represent hierarchical information of XML tree is assigning a specific node number to each node of XML tree. Insertion and deletion of XML node can occur at any position in a dynamic XML tree. A dynamic numbering scheme allows us to add nodes to or delete nodes from an XML tree without relabeling or with relabeling only a few existing nodes of XML tree while executing XML query efficiently. According to W3C XQuery update facility specifications a node can be added as first or last child of the existing node in XML tree. Generating new number for last child requires referencing the number of previous last child. Getting the number of last child is very costly with previous approaches. We have developed a new dynamic numbering scheme PSN which is very effective for insertion of a node as last child. Our approach reduces the time to find last child dramatically by removing sorting of children.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.476-479
• /
• 2003

The Rough transform (HT) is often used for extracting global features in binary images, for example curve and line segments, from local features such as single pixels. The HT is useful due to its insensitivity to missing edge points and occlusions, and robustness in noisy images. However, it possesses some disadvantages, such as time and memory consumption due to the number of input data and the selection of an optimal and efficient resolution of the accumulator space can be difficult. Another problem of the HT is in the difficulty of peak detection due to the discrete nature of the image space and the round off in estimation. In order to resolve the problem mentioned above, a possibilistic C-means approach to clustering [1] is used to cluster neighboring peaks. Several experimental results are given.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.766-771
• /
• 1993

A mathematical model is developed to represent the batch reactor for free radical polymerization of PMMA The model is validated by comparing the simulation result with the experimental data. A computational scheme is proposed to determine the trajectory of the reactor temperature that will produce polymer product having the desired molecular weight distribution. For this instantaneous number average chain length and polydispersity are introduced to calculate the reactor temperature. The former is assumed to be a second order polynomial of the sum of the living and dead polymer concentrations. Various reactor temperature, trajectories are observed depending on the reactor conditions and prescribed molecular weight distributions. Fuzzy and PID control algorithms are applied to trace the reactor temperature trajectory. While the PID control gives rise to an overshoot when the trajectory changes its direction, the fuzzy controller yields a more satisfactory performance because it secures information on the trajectory pattern.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.1
• /
• pp.31-36
• /
• 2010

Many clustering algorithms have been used in diverse fields. When we need to group given data set into clusters, many clustering algorithms based on similarity or distance measures are considered. Most clustering works have been based on hierarchical and non-hierarchical clustering algorithms. Generally, for the clustering works, researchers have used clustering algorithms case by case from these algorithms. Also they have to determine proper clustering methods subjectively by their prior knowledge. In this paper, to solve the subjective problem of clustering we make empirical comparisons of popular clustering algorithms which are hierarchical and non hierarchical techniques using Silhouette measure. We use silhouette information to evaluate the clustering results such as the number of clusters and cluster variance. We verify our comparison study by experimental results using data sets from UCI machine learning repository. Therefore we are able to use efficient and objective clustering algorithms.