• Title/Summary/Keyword: Intelligent Data Analysis

Search Result 1,456, Processing Time 0.029 seconds

A Study on the Incomplete Information Processing System(INiPS) Using Rough Set

  • Jeong, Gu-Beom;Chung, Hwan-Mook;Kim, Guk-Boh;Park, Kyung-Ok
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.243-251
    • /
    • 2000
  • In general, Rough Set theory is used for classification, inference, and decision analysis of incomplete data by using approximation space concepts in information system. Information system can include quantitative attribute values which have interval characteristics, or incomplete data such as multiple or unknown(missing) data. These incomplete data cause the inconsistency in information system and decrease the classification ability in system using Rough Sets. In this paper, we present various types of incomplete data which may occur in information system and propose INcomplete information Processing System(INiPS) which converts incomplete information system into complete information system in using Rough Sets.

  • PDF

Information Quantification Application to Management with Fuzzy Entropy and Similarity Measure

  • Wang, Hong-Mei;Lee, Sang-Hyuk
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.10 no.4
    • /
    • pp.275-280
    • /
    • 2010
  • Verification of efficiency in data management fuzzy entropy and similarity measure were discussed and verified by applying reliable data selection problem and numerical data similarity evaluation. In order to calculate the certainty or uncertainty fuzzy entropy and similarity measure are designed and proved. Designed fuzzy entropy and similarity are considered as dissimilarity measure and similarity measure, and the relation between two measures are explained through graphical illustration. Obtained measures are useful to the application of decision theory and mutual information analysis problem. Extension of data quantification results based on the proposed measures are applicable to the decision making and fuzzy game theory.

Design of the Integrated Incomplete Information Processing System based on Rough Set

  • Jeong, Gu-Beom;Chung, Hwan-Mook;Kim, Guk-Boh;Park, Kyung-Ok
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.5
    • /
    • pp.441-447
    • /
    • 2001
  • In general, Rough Set theory is used for classification, inference, and decision analysis of incomplete data by using approximation space concepts in information system. Information system can include quantitative attribute values which have interval characteristics, or incomplete data such as multiple or unknown(missing) data. These incomplete data cause tole inconsistency in information system and decrease the classification ability in system using Rough Sets. In this paper, we present various types of incomplete data which may occur in information system and propose INcomplete information Processing System(INiPS) which converts incomplete information system into complete information system in using Rough Sets.

  • PDF

A Construction of Fuzzy Model for Data Mining

  • Kim, Do-Wan;Joo, Young-Hoon;Park, Jin-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.2
    • /
    • pp.209-215
    • /
    • 2003
  • A new GA-based methodology using information granules is suggested for the construction of fuzzy classifiers. The proposed scheme consists of three steps: selection of information granules, construction of the associated fuzzy sets, and tuning of the fuzzy rules. First, the genetic algorithm (GA) is applied to the development of the adequate information granules. The fuzzy sets are then constructed from the analysis of the developed information granules. An interpretable fuzzy classifier is designed by using the constructed fuzzy sets. Finally, the GA are utilized for tuning of the fuzzy rules, which can enhance the classification performance on the misclassified data (e.g., data with the strange pattern or on the boundaries of the classes). To show the effectiveness of the proposed method, an example, the classification of the Iris data, is provided.

Splitting Decision Tree Nodes with Multiple Target Variables (의사결정나무에서 다중 목표변수를 고려한)

  • 김성준
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.05a
    • /
    • pp.243-246
    • /
    • 2003
  • Data mining is a process of discovering useful patterns for decision making from an amount of data. It has recently received much attention in a wide range of business and engineering fields Classifying a group into subgroups is one of the most important subjects in data mining Tree-based methods, known as decision trees, provide an efficient way to finding classification models. The primary concern in tree learning is to minimize a node impurity, which is evaluated using a target variable in the data set. However, there are situations where multiple target variables should be taken into account, for example, such as manufacturing process monitoring, marketing science, and clinical and health analysis. The purpose of this article is to present several methods for measuring the node impurity, which are applicable to data sets with multiple target variables. For illustrations, numerical examples are given with discussion.

  • PDF

Modeling of Nonlinear Dynamic Dynamic Systems Using a Modified GMDH Algorithm (수정된 GMDH 알고리즘을 이용한 비선형 동적 시스템의 모델링)

  • 홍연찬;엄상수
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.3
    • /
    • pp.50-55
    • /
    • 1998
  • The GMDH(Group Method of Data Handling) is a useful data analysis technique for identification of nonlinear complex systems. Therefore, in this paper the application method of GMDH algorithm for modeling nonlinear dynamic systems is proposed. The identification of dynamic systems by using GMDH consists of applying a set of input/output data and computing the necessary coefficient set dynamically. Also, in this paper, by reducing sequentially the criterion which can adopt or reject the data, a method to prevent excessive computation that is a disadvantage of GMDH is proposed.

  • PDF

A Prediction Model Based on Relevance Vector Machine and Granularity Analysis

  • Cho, Young Im
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.3
    • /
    • pp.157-162
    • /
    • 2016
  • In this paper, a yield prediction model based on relevance vector machine (RVM) and a granular computing model (quotient space theory) is presented. With a granular computing model, massive and complex meteorological data can be analyzed at different layers of different grain sizes, and new meteorological feature data sets can be formed in this way. In order to forecast the crop yield, a grey model is introduced to label the training sample data sets, which also can be used for computing the tendency yield. An RVM algorithm is introduced as the classification model for meteorological data mining. Experiments on data sets from the real world using this model show an advantage in terms of yield prediction compared with other models.

Recursive PCA-based Remote Sensor Data Management System Applicable to Sensor Network

  • Kim, Sung-Ho;Youk, Yui-Su
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.2
    • /
    • pp.126-131
    • /
    • 2008
  • Wireless Sensor Network(WSNs) consists of small sensor nodes with sensing, computation, and wireless communication capabilities. It has new information collection scheme and monitoring solution for a variety of applications. Faults occurring to sensor nodes are common due to the limited resources and the harsh environment where the sensor nodes are deployed. In order to ensure the network quality of service it is necessary for the WSN to be able to detect the faulty sensors and take necessary actions for the reconstruction of the lost sensor data caused by fault as earlier as possible. In this paper, we propose an recursive PCA-based fault detection and lost data reconstruction algorithm for sensor networks. Also, the performance of proposed scheme was verified with simulation studies.

Study on the Distribution Environmental Characteristics of Unmanned Stores

  • Soyeon, PARK
    • Journal of Distribution Science
    • /
    • v.21 no.3
    • /
    • pp.101-111
    • /
    • 2023
  • Purpose: The first purpose of this study is deriving in-store characteristics that affect the experience of customers using unmanned stores and reveals the value of major services that customers feel and experience. Also, an empirical analysis is conducted on the effect of intelligent consumption value after using unmanned stores on consumption emotions and continuous use intention, and the modulating effect of customers' untact tendency on environmental characteristics and the value of intelligent services is verified. Research design, data and methodology: Samples were taken from 186 people who visited the unmanned store from April to June 2022 to investigate the research model. Results: It was found that the environmental characteristics of unmanned stores had a positive effect on the intelligent service value. Also, the higher the value of intelligent service, the stronger the influence on consumption emotions, and the higher the value of the intelligence service and consumption emotions, the stronger the impact on the intention to use intention. The untact propensity played a role in controlling the relationship between ease of using technology and the intelligent service value and the relationship between spatial arrangement and functionality and intelligent service value. Conclusion: In order to improve unmanned store service in the trend of spreading unmanned stores, it is necessary to not only improve the technology using convenience in terms of store environmental characteristics but also create innovative consumption experiences in terms of space layout, function, and convenience of payment.

A Big Data Learning for Patent Analysis (특허분석을 위한 빅 데이터학습)

  • Jun, Sunghae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.5
    • /
    • pp.406-411
    • /
    • 2013
  • Big data issue has been considered in diverse fields. Also, big data learning has been required in all areas such as engineering and social science. Statistics and machine learning algorithms are representative tools for big data learning. In this paper, we study learning tools for big data and propose an efficient methodology for big data learning via legacy data to practical application. We apply our big data learning to patent analysis, because patent is one of big data. Also, we use patent analysis result for technology forecasting. To illustrate how the proposed methodology could be applied in real domain, we will retrieve patents related to big data from patent databases in the world. Using searched patent data, we perform a case study by text mining preprocessing and multiple linear regression of statistics.