• Korean Journal of Remote Sensing
• /
• v.19 no.2
• /
• pp.135-147
• /
• 2003

This study used the multistage hierarchical clustering image classification to analyze the satellite images for the land-cover types of an area in the Korean peninsula. The multistage algorithm consists of two stages. The first stage performs region-growing segmentation by employing a hierarchical clustering procedure with the restriction that pixels in a cluster must be spatially contiguous, and finally the whole image space is segmented into sub-regions where adjacent regions have different physical properties. Without spatial constraints for merging, the second stage clusters the segments resulting from the previous stage. The image classification of hierarchical clustering, which merges step-by step two small groups into one large one based on the hierarchical structure of digital imagery, generates a hierarchical tree of the relation between the classified regions. The experimental results show that the hierarchical tree has the detailed information on the hierarchical structure of land-use and more detailed spectral information is required for the correct analysis of land-cover types.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.233-241
• /
• 2012

The object of the project management is to succeed in the project. However, could you definitely judge that the result of project performance is a success? In addition, do both customer and developer agree with the result of your judgement? There are a lot of definitions and measure for the success and failure of the software development suggested, but there is no definite standard for the classification. This paper examines the measures in order to decide the development success and re-defines the success and the failure of the project. We suggest the measure and the standard that judge the project achievement based on these definitions. Applying the suggested measure and standard, it is possible to reduce arguments between the customer and the developer on the classification of the success and the failure.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.163-172
• /
• 2022

The interconnection of an enormous number of devices into the Internet at a massive scale is a consequence of the Internet of Things (IoT). As a result, tasks offloading from these IoT devices to remote cloud data centers become expensive and inefficient as their number and amount of its emitted data increase exponentially. It is also a challenge to optimize IoT device energy consumption while meeting its application time deadline and data delivery constraints. Consequently, Fog Computing was proposed to support efficient IoT tasks processing as it has a feature of lower service delay, being adjacent to IoT nodes. However, cloud task offloading is still performed frequently as Fog computing has less resources compared to remote cloud. Thus, optimized schemes are required to correctly characterize and distribute IoT devices tasks offloading in a hybrid IoT, Fog, and cloud paradigm. In this paper, we present a detailed survey and classification of of recently published research articles that address the energy efficiency of task offloading schemes in IoT-Fog-Cloud paradigm. Moreover, we also developed a taxonomy for the classification of these schemes and provided a comparative study of different schemes: by identifying achieved advantage and disadvantage of each scheme, as well its related drawbacks and limitations. Moreover, we also state open research issues in the development of energy efficient, scalable, optimized task offloading schemes for Fog computing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1186-1207
• /
• 2024

Bearings are one of the main components of mechanical equipment and one of the primary components prone to faults. Therefore, conducting fault diagnosis on bearings is a key issue in mechanical equipment research. Belief rule base (BRB) is essentially an expert system that effectively integrates qualitative and quantitative information, demonstrating excellent performance in fault diagnosis. However, class imbalance often occurs in the diagnosis task, which poses challenges to the diagnosis. Models with interpretability can enhance decision-makers' trust in the output results. However, the randomness in the optimization process can undermine interpretability, thereby reducing the level of trustworthiness in the results. Therefore, a hierarchical BRB model based on extreme gradient boosting (XGBoost) feature selection with interpretability (HFS-IBRB) is proposed in this paper. Utilizing a main BRB alongside multiple sub-BRBs allows for the conversion of a multi-classification challenge into several distinct binary classification tasks, thereby leading to enhanced accuracy. By incorporating interpretability constraints into the model, interpretability is effectively ensured. Finally, the case study of the actual dataset of bearing fault diagnosis demonstrates the ability of the HFS-IBRB model to perform accurate and interpretable diagnosis.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.102-116
• /
• 2006

Electronic catalogs (or e-catalogs) hold information about the goods and services offered or requested by the participants, and consequently, form the basis of an e-commerce transaction. Catalog management is complicated by a number of factors and product classification is at the core of these issues. Classification hierarchy is used for spend analysis, custom3 regulation, and product identification. Classification is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. However, product classification has received little formal treatment in terms of underlying model, operations, and semantics. We believe that the lack of a logical model for classification Introduces a number of problems not only for the classification itself but also for the product database in general. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eClass, however, have a lot of limitations to meet these requirements for dynamic features of classification. In this paper, we try to understand what it means to classify products and present how best to represent classification schemes so as to capture the semantics behind the classifications and facilitate mappings between them. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes. And describe the semantic classification model, which satisfies the requirements for dynamic features oi product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph. We believe the model proposed in this paper satisfies the requirements and challenges that have been raised by previous works.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.657-668
• /
• 2001

It is difficult that web documents are classified with exact user intention because existing document classification systems are based on word frequency number using single keyword. To improve this defect, first, we use keyword, a query, domain knowledge. Like explanation based learning, first, query is analyzed with knowledge based information and then structured user intention information is extracted. We use this intention tree in the course of existing word frequency number based document classification as user information and constraints. Thus, we can classify web documents with more exact user intention. In classifying document, structured user intention information is helpful to keep more documents and information which can be lost in the system using single keyword information. Our hybrid approach integrating user intention information with existing statistics and probability method is more efficient to decide direction and range of document category than existing word frequency approach.

• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.2
• /
• pp.73-78
• /
• 2020

Musculoskeletal disease is often caused by sitting down for long period's time or by bad posture habits. In order to prevent musculoskeletal disease in daily life, it is the most important to correct the bad sitting posture to the right one through real-time monitoring. In this study, to detect the sitting information of user's without any constraints, we propose posture measurement system based on multi-channel pressure sensor and CNN model for classifying sitting posture types. The proposed CNN model can analyze 5 types of sitting postures based on sitting posture information. For the performance assessment of posture classification CNN model through field test, the accuracy, recall, precision, and F1 of the classification results were checked with 10 subjects. As the experiment results, 99.84% of accuracy, 99.6% of recall, 99.6% of precision, and 99.6% of F1 were verified.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.420-426
• /
• 2022

Breast cancer is among the cancers that may be healed as the disease diagnosed at early times before it is distributed through all the areas of the body. The Automatic Analysis of Diagnostic Tests (AAT) is an automated assistance for physicians that can deliver reliable findings to analyze the critically endangered diseases. Deep learning, a family of machine learning methods, has grown at an astonishing pace in recent years. It is used to search and render diagnoses in fields from banking to medicine to machine learning. We attempt to create a deep learning algorithm that can reliably diagnose the breast cancer in the mammogram. We want the algorithm to identify it as cancer, or this image is not cancer, allowing use of a full testing dataset of either strong clinical annotations in training data or the cancer status only, in which a few images of either cancers or noncancer were annotated. Even with this technique, the photographs would be annotated with the condition; an optional portion of the annotated image will then act as the mark. The final stage of the suggested system doesn't need any based labels to be accessible during model training. Furthermore, the results of the review process suggest that deep learning approaches have surpassed the extent of the level of state-of-of-the-the-the-art in tumor identification, feature extraction, and classification. in these three ways, the paper explains why learning algorithms were applied: train the network from scratch, transplanting certain deep learning concepts and constraints into a network, and (another way) reducing the amount of parameters in the trained nets, are two functions that help expand the scope of the networks. Researchers in economically developing countries have applied deep learning imaging devices to cancer detection; on the other hand, cancer chances have gone through the roof in Africa. Convolutional Neural Network (CNN) is a sort of deep learning that can aid you with a variety of other activities, such as speech recognition, image recognition, and classification. To accomplish this goal in this article, we will use CNN to categorize and identify breast cancer photographs from the available databases from the US Centers for Disease Control and Prevention.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.12
• /
• pp.21-30
• /
• 1993

In this paper, we propose a connected Korean digit recohnition system employing neural networks and lexical constraints of the Korean digits. In the proposed recognition system, firstly, each frame of digit string is labelled by phoneme classification neural networks.which are trained with the reference phoneme segments extracted form an isolated digit based on the position information. And, the frame labels are combined with each other for constructing the phoneme segments. Then, these segments are combined to form a digit candidate using the digit combination rules. The digit candidate is decided based on the condition for digit decision. If the condition is not satisfied, the digit candidate is further recognized using the digit decision neural network in the next step. In our approach, the neural networks are trained with 10 isolated digits uttered by 5 male speakers. To investigate the performance of the proposed recognition system, an intensive computer simulation on the 30 connected digit strings uttered by 5 male speakers is performed. The simulation result indicates that 95.6% digit recognition rate and 82% digit string recognition rate are provided by the proposed Korean digit recognition system.

• The Korean Journal of Applied Statistics
• /
• v.24 no.1
• /
• pp.137-143
• /
• 2011

The classification of subjects with unknown distribution in a small sample size often involves order-restricted constraints in multivariate parameter setups. Those problems make the optimality of a conventional likelihood ratio based statistical inferences not feasible. Fortunately, Roy (1953) introduced union-intersection principle(UIP) which provides an alternative avenue. Multivariate linear rank statistics along with that principle, yield a considerably appropriate robust testing procedure. Furthermore, conditionally distribution-free test based upon exact permutation theory is used to generate p-values, even in a small sample. Applications of this method are illustrated in a real microarray data example (Lobenhofer et al., 2002).