• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.6
• /
• pp.599-603
• /
• 2008

Flash memory has its unique characteristics: the write operation is much more costly than the read operation and in-place updating is not allowed. In this paper, we analyze how these characteristics of flash memory affect the performance of clustering and non-clustering in record management, and shows that non-clustering is more suitable in flash memory environment, which does not hold in disk environment. Also, we discuss the problems of the existing non-clustering method, and identify considerable designing factors of record management method in flash memory environment.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.59-69
• /
• 2005

Data mining technique is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. Clustering is the process of grouping the data into clusters so that objects within a cluster have high similarity in comparison to one another. It has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research on off-line or on-line and so on. We analyze Gyeongnam social indicator survey data by 2001 using twostep clustering technique for environment information. The twostep clustering is classified as a partitional clustering method. We can apply these twostep clustering outputs to environmental preservation and improvement.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.1
• /
• pp.1-11
• /
• 2006

Data mining technique is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. Clustering is the process of grouping the data into clusters so that objects within a cluster have high similarity in comparison to one another. It has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research on off-line or on-line and so on. We analyze Gyeongnam social indicator survey data by 2001 using twostep clustering technique for environment information. The twostep clustering is classified as a partitional clustering method. We can apply these twostep clustering outputs to environmental preservation and improvement.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.566-571
• /
• 2009

This paper proposes noise-robust fast speaker adaptation method based on the eigenvoice framework in various noisy environments. The proposed method is focused on de-noising and environment clustering. Since the de-noised adaptation DB still has residual noise in itself, environment clustering divides the noisy adaptation data into similar environments by a clustering method using the cepstral mean of non-speech segments as a feature vector. Then each adaptation data in the same cluster is used to build an environment-clustered speaker adapted (SA) model. After selecting multiple environmentally clustered SA models which are similar to test environment, the speaker adaptation based on an appropriate linear combination of clustered SA models is conducted. According to our experiments, we observe that the proposed method provides error rate reduction of $40{\sim}59%$ over baseline with speaker independent model.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.11-20
• /
• 2010

Ontology is important role in semantic web to construct and query semantic data. Because of dynamic characteristic of ontology, P2P environment is considered for ontology processing in web environment. For efficient processing of ontology in P2P environment, clustering of peers should be considered. When new peer is added to the network, cluster allocation problem of the new peer is important for system efficiency. For clustering of peers with similar chateristics, similarlity measure method of ontology in added peer with ontologies in other clusters is needed. In this paper, we propose similarity measure techniques of ontologies for clustering of peers. Similarity measure method in this paper considered ontology's strucural characteristics like schema, class, property. Results of experiments show that ontologies of similar topics, class, property can be allocated to the same cluster.

• Journal of Korea Entertainment Industry Association
• /
• v.14 no.4
• /
• pp.349-354
• /
• 2020

This paper, firstly, propose a new Clustering scheme Based on Conceptual graphs (CBC) that can describe objects freely and can perform clustering efficiently. The conceptual clustering is one of machine learning technique. The similarity among the objects in conceptual clustering are decided on the bases of concept membership, unlike the general clustering scheme which decide the similarity without considering the context or environment of the objects. A new conceptual clustering scheme, CBC, which can perform efficient conceptual clustering by describing various objects freely with conceptual graphs is introduced in this paper.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.2
• /
• pp.47-59
• /
• 2014

In this paper, I propose a new energy efficient clustering scheme to prolong the network lifetime by reducing energy consumption at the sensor node. It is possible that a node determines whether to participate in clustering with certain probability based on local density. This scheme is useful under the environment that sensor nodes are deployed unevenly within the sensing area. By adjusting the probability of participating in clustering dynamically with local density of nodes, the energy consumption of the network is reduced. So, the lifetime of the network is extended. In the region where nodes are densely deployed, it is possible to reduce the energy consumption of the network by limiting the number of node which is participated in clustering with probability which can be adjusted dynamically based on local density of the node. Through computer simulation, it is verified that the proposed scheme is more energy efficient than LEACH protocol under the environment where node are densely located in a specific area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.860-862
• /
• 2015

In this paper, we propose a new type of IAM clustering architecture for the efficiency of user authentication and authorization in the Inter-Cloud environment. clustering architecture allows users to easily use un-registered services with their registered authentication and access permissions through pre-Access Agreement. through this paper, we explain our authentication protocol and IAM clustering architecture components.

• Proceedings of the KSPS conference
• /
• 2007.05a
• /
• pp.33-36
• /
• 2007

In this paper, we investigate a fast speaker adaptation method based on eigenvoice in several noisy environments. In order to overcome its weakness against noise, we propose a noisy environment clustering method which divides the noisy adaptation utterances into utterance groups with similar environments by the vector quantization based clustering using a cepstral mean as a feature vector. Then each utterance group is used for adaptation to make an environment dependent model. According to our experiment, we obtained 19-37 % relative improvement in error rate compared with the simultaneous speaker adaptation and environmental compensation method

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.241-241
• /
• 2000

In this Paper, we present a new efficient algorithm that can segment an object in the image. There are many algorithms for segmentation and many studies for criteria or threshold value. But, if the environment or brightness is changed, their would not be suitable. Accordingly, we apply a clustering algorithm for adopting and compensating environmental factors. And applying labeling method, we try arranging segment by the similarity that calculated with the fuzzy algorithm. we also present simulations for searching an object and show that the algorithm is somewhat more efficient than the other algorithm.