• 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.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.4
• /
• pp.245-253
• /
• 2013

Knowledge representation realized by information granules is one of the essential facets of granular computing and an area of intensive research. Fuzzy clustering and clustering are general vehicles to realize formation of information granules. Granulation - degranulation paradigm is one of the schemes determining and quantifying functionality and knowledge representation capabilities of information granules. In this study, we augment this paradigm by forming and optimizing a collection of associations among original and transformed information granules. We discuss several transformation schemes and analyze their properties. A series of numeric experiments is provided using which we quantify the improvement of the degranulation mechanisms offered by the optimized transformation of information granules.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.2
• /
• pp.87-95
• /
• 2015

In this study, we pursue a new direction for system modeling by introducing the concept of granular models, which produce results in the form of information granules (such as intervals, fuzzy sets, and rough sets). We present a rationale and several key motivating arguments behind the use of granular models and discuss their underlying design processes. The development of the granular model includes optimal allocation of information granularity through optimizing the criteria of coverage and specificity. The emergence and construction of granular models of type-2 and type-n (in general) is discussed. It is shown that achieving a suitable coverage-specificity tradeoff (compromise) is essential for developing granular models.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.3
• /
• pp.256-264
• /
• 2004

The granular flow has been numerically studied by using DEM(Discrete Element Method). The eve교 particle is checked if it collides neighbor particles, and the next motion of the particle is predicted. The computing time has been drastically reduced by improving the collision check against neighboring particles. The comparison of the present method with ail experiment for the vibrating floor problem shows the good accuracy. The broken tower problem has been calculated to show the good comparison with the other computational result. This DEM(Discrete Element Method) can be a useful tool for constructing the constitute equation of the continuum approach of the granular flow.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.672-674
• /
• 2000

There are various ways in classification methodologies of data mining such as neural networks but the result should be explicit and understandable and the classification rules be short and clear. Rough set theory is a effective technique in extracting knowledge from incomplete and inconsistent information and makes an offer classification and approximation by various attributes with effect. This paper discusses granularity of knowledge for reasoning of uncertain concepts by using generalized rough set approximations based on hierarchical granulation structure and uses hierarchical classification methodology that is more effective technique for classification by applying core to upper level. The consistency rules with minimal attributes is discovered and applied to classifying real data.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.397-412
• /
• 2011

Granular Computing has emerged as a unified and coherent framework of designing, processing, and interpretation of information granules. Information granules are formalized within various frameworks such as sets (interval mathematics), fuzzy sets, rough sets, shadowed sets, probabilities (probability density functions), to name several the most visible approaches. In spite of the apparent diversity of the existing formalisms, there are some underlying commonalities articulated in terms of the fundamentals, algorithmic developments and ensuing application domains. In this study, we introduce two pivotal concepts: a principle of justifiable granularity and a method of an optimal information allocation where information granularity is regarded as an important design asset. We show that these two concepts are relevant to various formal setups of information granularity and offer constructs supporting the design of information granules and their processing. A suite of applied studies is focused on knowledge management in which case we identify several key categories of schemes present there.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.435-447
• /
• 2017

Associative and bidirectional associative memories are examples of associative structures studied intensively in the literature. The underlying idea is to realize associative mapping so that the recall processes (one-directional and bidirectional ones) are realized with minimal recall errors. Associative and fuzzy associative memories have been studied in numerous areas yielding efficient applications for image recall and enhancements and fuzzy controllers, which can be regarded as one-directional associative memories. In this study, we revisit and augment the concept of associative memories by offering some new design insights where the corresponding mappings are realized on the basis of a related collection of landmarks (prototypes) over which an associative mapping becomes spanned. In light of the bidirectional character of mappings, we have developed an augmentation of the existing fuzzy clustering (fuzzy c-means, FCM) in the form of a so-called collaborative fuzzy clustering. Here, an interaction in the formation of prototypes is optimized so that the bidirectional recall errors can be minimized. Furthermore, we generalized the mapping into its granular version in which numeric prototypes that are formed through the clustering process are made granular so that the quality of the recall can be quantified. We propose several scenarios in which the allocation of information granularity is aimed at the optimization of the characteristics of recalled results (information granules) that are quantified in terms of coverage and specificity. We also introduce various architectural augmentations of the associative structures.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.241-242
• /
• 2008

본 논문에서는 fuzzy granular computing 방법 중의 하나인 context-based FCM을 이용하여 granular-based radial basis function neural network에 대한 기본적인 개면과 그들의 포괄적인 설계 구조에 대해서 자세히 기술한다. 제안된 모델에 기본이 되는 설계 도구는 context-based fuzzy c-means (C-FCM)로 알려진 fuzzy clustering에 초점이 맞춰져 있으며, 이는 주어진 데이터의 특징에 맞게 공간을 분할함으로써 효율적으로 모델을 구축할 수가 있다. 제안된 모델의 설계 공정은 1) Context fuzzy set에 대한 정의와 설계, 2) Context-based fuzzy clustering에 대한 모델의 적용과 이에 따른 모델 구축의 효율성, 3) 입력과 출력공간에서의 연결된 information granule에 대한 parameter(다항식의 계수들)에 대한 최적화와 같은 단계로 구성되어 있다. Information granule에 대한 parameter들은 성능지수를 최소화하기 위해 Least square method에 의해서 보정된다. 본 논문에서는 모델을 설계함에 있어서 체계적인 설계 알고리즘을 포괄적으로 설명하고 있으며 더 나아가 제안된 모델의 성능을 다른 표준적인 모델들과 대조함으로써 제안된 모델의 우수성을 나타내고자 한다.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.11a
• /
• pp.197-203
• /
• 1998

The discrete element method is a numerical model capable of describing the mechanical behaviour of assemblies of discs and spheres. The method is based on the use of an explicit numerical scheme in which the interaction of the particles is monitored contact by contact and the motion of the particles modelled particle by particle. In this paper, A two-dimensional model for computing contacts and motions of granular particles of unform, inelasticity is presented. And, code is developed. The primary aim of this paper is to approv computational result of continuum alaysis which is on processing. The end of this paper, that code is tested with several examples.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.184-200
• /
• 2020

Similarity searching is a basic issue in information processing because of the large size of formal contexts and their complicated derivation operators. Recently, some researchers have focused on knowledge reduction methods by using granular computing. In this process, suitable information granules are vital to characterizing the quantities of attributes and objects. To address this problem, a novel approach to obtain an entropy-weighted concept lattice with inclusion degree and similarity distance (ECLisd) has been proposed. The approach aims to compute the combined weights by merging the inclusion degree and entropy degree between two concepts. In addition, another method is utilized to measure the hierarchical distance by considering the different degrees of importance of each attribute. Finally, the rationality of the ECLisd is validated via a comparative analysis.