نتایج جستجو برای: fuzzy partitions

تعداد نتایج: 103595  

Journal: :IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society 2007
Pradipta Maji Sankar K. Pal

A generalized hybrid unsupervised learning algorithm, which is termed as rough-fuzzy possibilistic c-means (RFPCM), is proposed in this paper. It comprises a judicious integration of the principles of rough and fuzzy sets. While the concept of lower and upper approximations of rough sets deals with uncertainty, vagueness, and incompleteness in class definition, the membership function of fuzzy ...

A. Habibzadeh, A. Mekanik H. Sayehvand

In the present study, natural convective heat transfer in a partitioned square cavity utilizing nanofluids is studied. The vertical left and right walls are considered as the hot and cold walls, respectively and the partitions assumed to be adiabatic. The nanofluid used in this study is Al2O3 with the volume fraction of 20%. It is assumed that nanofluid is a single phase f...

2011
Jobin Christ

Problem statement: Segmentation plays an important role in medical imaging. Segmentation of an image is the division or separation of the image into dissimilar regions of similar attribute. In this study we proposed a methodology that integrates clustering algorithm and marker controlled watershed segmentation algorithm for medical image segmentation. The use of the conservative watershed algor...

2000
Attila Gyenesei

The problem of mining association rules for fuzzy quantitative items was introduced and an algorithm proposed in [7]. However, the algorithm assumes that fuzzy sets are given. In this paper we propose a method to nd the fuzzy sets for each quantitative attribute in a database by using clustering techniques. We present a scheme for nding the optimal partitioning of a data set during the clusteri...

Journal: :Int. J. Approx. Reasoning 2016
Daniel Gómez J. Tinguaro Rodríguez Javier Yáñez Javier Montero

One of the main challenges of fuzzy community detection problems is to be able to measure the quality of a fuzzy partition. In this paper, we present an alternative way of measuring the quality of a fuzzy community detection output based on n-dimensional grouping and overlap functions. Moreover, the proposed modularity measure generalizes the classical Girvan-Newman (GN) modularity for crisp co...

Journal: :Intell. Data Anal. 2008
V. Esmaeili Amin Assareh Mohammad Bagher Shamsollahi Mohammad Hassan Moradi N. M. Arefian

Estimating the depth of anesthesia (DOA) is still a challenging area in anesthesia research. The objective of this study was to design a fuzzy rule based system which integrates electroencephalogram (EEG) features to quantitatively estimate the DOA. The proposed method is based on the analysis of single-channel EEG using frequency and time domain methods. A clinical study was conducted on 22 pa...

Journal: :Soft Comput. 2011
Rafael Alcalá Yusuke Nojima Francisco Herrera Hisao Ishibuchi

Multiobjective genetic fuzzy rule selection is based on the generation of a set of candidate fuzzy classification rules using a preestablished granularity or multiple fuzzy partitions with different granularities for each attribute. Then, a multiobjective evolutionary algorithm is applied to perform fuzzy rule selection. Since using multiple granularities for the same attribute has been sometim...

Journal: :Fuzzy Sets and Systems 2013
Andrés Jiménez-Losada Julio Rodrigo Fernández García Manuel Ordóñez

In 1977, Myerson considered cooperative games with communication structure. A communication structure is an undirected graph describing the bilateral relationships among the players. He introduced the concept of allocation rule for a game as a function obtaining an outcome for each communication structure among the players of the game. The Myerson value is a specific allocation rule extending t...

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید