Sistemas granulares evolutivos

Orientador: Fernando Antonio Campos GomideTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: Recentemente tem-se observado um crescente interesse em abordagens de modelagem computacional para lidar com fluxos de dados do mundo real. Métodos e algoritmos têm sido propostos para obtenção de conhecimento a partir de conjuntos de dados muito grandes e, a princípio, sem valor aparente. Este trabalho apresenta uma plataforma computacional para modelagem granular evolutiva de fluxos de dados incertos. Sistemas granulares evolutivos abrangem uma variedade de abordagens para modelagem on-line inspiradas na forma com que os humanos lidam com a complexidade. Esses sistemas exploram o fluxo de informação em ambiente dinâmico e extrai disso modelos que podem ser linguisticamente entendidos. Particularmente, a granulação da informação é uma técnica natural para dispensar atenção a detalhes desnecessários e enfatizar transparência, interpretabilidade e escalabilidade de sistemas de informação. Dados incertos (granulares) surgem a partir de percepções ou descrições imprecisas do valor de uma variável. De maneira geral, vários fatores podem afetar a escolha da representação dos dados tal que o objeto representativo reflita o significado do conceito que ele está sendo usado para representar. Neste trabalho são considerados dados numéricos, intervalares e fuzzy; e modelos intervalares, fuzzy e neuro-fuzzy. A aprendizagem de sistemas granulares é baseada em algoritmos incrementais que constroem a estrutura do modelo sem conhecimento anterior sobre o processo e adapta os parâmetros do modelo sempre que necessário. Este paradigma de aprendizagem é particularmente importante uma vez que ele evita a reconstrução e o retreinamento do modelo quando o ambiente muda. Exemplos de aplicação em classificação, aproximação de função, predição de séries temporais e controle usando dados sintéticos e reais ilustram a utilidade das abordagens de modelagem granular propostas. O comportamento de fluxos de dados não-estacionários com mudanças graduais e abruptas de regime é também analisado dentro do paradigma de computação granular evolutiva. Realçamos o papel da computação intervalar, fuzzy e neuro-fuzzy em processar dados incertos e prover soluções aproximadas de alta qualidade e sumário de regras de conjuntos de dados de entrada e saída. As abordagens e o paradigma introduzidos constituem uma extensão natural de sistemas inteligentes evolutivos para processamento de dados numéricos a sistemas granulares evolutivos para processamento de dados granularesAbstract: In recent years there has been increasing interest in computational modeling approaches to deal with real-world data streams. Methods and algorithms have been proposed to uncover meaningful knowledge from very large (often unbounded) data sets in principle with no apparent value. This thesis introduces a framework for evolving granular modeling of uncertain data streams. Evolving granular systems comprise an array of online modeling approaches inspired by the way in which humans deal with complexity. These systems explore the information flow in dynamic environments and derive from it models that can be linguistically understood. Particularly, information granulation is a natural technique to dispense unnecessary details and emphasize transparency, interpretability and scalability of information systems. Uncertain (granular) data arise from imprecise perception or description of the value of a variable. Broadly stated, various factors can affect one's choice of data representation such that the representing object conveys the meaning of the concept it is being used to represent. Of particular concern to this work are numerical, interval, and fuzzy types of granular data; and interval, fuzzy, and neurofuzzy modeling frameworks. Learning in evolving granular systems is based on incremental algorithms that build model structure from scratch on a per-sample basis and adapt model parameters whenever necessary. This learning paradigm is meaningful once it avoids redesigning and retraining models all along if the system changes. Application examples in classification, function approximation, time-series prediction and control using real and synthetic data illustrate the usefulness of the granular approaches and framework proposed. The behavior of nonstationary data streams with gradual and abrupt regime shifts is also analyzed in the realm of evolving granular computing. We shed light upon the role of interval, fuzzy, and neurofuzzy computing in processing uncertain data and providing high-quality approximate solutions and rule summary of input-output data sets. The approaches and framework introduced constitute a natural extension of evolving intelligent systems over numeric data streams to evolving granular systems over granular data streamsDoutoradoAutomaçãoDoutor em Engenharia Elétric

Collected Papers (on various scientific topics), Volume XII

This twelfth volume of Collected Papers includes 86 papers comprising 976 pages on Neutrosophics Theory and Applications, published between 2013-2021 in the international journal and book series “Neutrosophic Sets and Systems” by the author alone or in collaboration with the following 112 co-authors (alphabetically ordered) from 21 countries: Abdel Nasser H. Zaied, Muhammad Akram, Bobin Albert, S. A. Alblowi, S. Anitha, Guennoun Asmae, Assia Bakali, Ayman M. Manie, Abdul Sami Awan, Azeddine Elhassouny, Erick González-Caballero, D. Dafik, Mithun Datta, Arindam Dey, Mamouni Dhar, Christopher Dyer, Nur Ain Ebas, Mohamed Eisa, Ahmed K. Essa, Faruk Karaaslan, João Alcione Sganderla Figueiredo, Jorge Fernando Goyes García, N. Ramila Gandhi, Sudipta Gayen, Gustavo Alvarez Gómez, Sharon Dinarza Álvarez Gómez, Haitham A. El-Ghareeb, Hamiden Abd El-Wahed Khalifa, Masooma Raza Hashmi, Ibrahim M. Hezam, German Acurio Hidalgo, Le Hoang Son, R. Jahir Hussain, S. Satham Hussain, Ali Hussein Mahmood Al-Obaidi, Hays Hatem Imran, Nabeela Ishfaq, Saeid Jafari, R. Jansi, V. Jeyanthi, M. Jeyaraman, Sripati Jha, Jun Ye, W.B. Vasantha Kandasamy, Abdullah Kargın, J. Kavikumar, Kawther Fawzi Hamza Alhasan, Huda E. Khalid, Neha Andalleb Khalid, Mohsin Khalid, Madad Khan, D. Koley, Valeri Kroumov, Manoranjan Kumar Singh, Pavan Kumar, Prem Kumar Singh, Ranjan Kumar, Malayalan Lathamaheswari, A.N. Mangayarkkarasi, Carlos Rosero Martínez, Marvelio Alfaro Matos, Mai Mohamed, Nivetha Martin, Mohamed Abdel-Basset, Mohamed Talea, K. Mohana, Muhammad Irfan Ahamad, Rana Muhammad Zulqarnain, Muhammad Riaz, Muhammad Saeed, Muhammad Saqlain, Muhammad Shabir, Muhammad Zeeshan, Anjan Mukherjee, Mumtaz Ali, Deivanayagampillai Nagarajan, Iqra Nawaz, Munazza Naz, Roan Thi Ngan, Necati Olgun, Rodolfo González Ortega, P. Pandiammal, I. Pradeepa, R. Princy, Marcos David Oviedo Rodríguez, Jesús Estupiñán Ricardo, A. Rohini, Sabu Sebastian, Abhijit Saha, Mehmet Șahin, Said Broumi, Saima Anis, A.A. Salama, Ganeshsree Selvachandran, Seyed Ahmad Edalatpanah, Sajana Shaik, Soufiane Idbrahim, S. Sowndrarajan, Mohamed Talea, Ruipu Tan, Chalapathi Tekuri, Selçuk Topal, S. P. Tiwari, Vakkas Uluçay, Maikel Leyva Vázquez, Chinnadurai Veerappan, M. Venkatachalam, Luige Vlădăreanu, Ştefan Vlăduţescu, Young Bae Jun, Wadei F. Al-Omeri, Xiao Long Xin.‬‬‬‬‬

Gravitation-Based Edge Detection in Hyperspectral Images

Edge detection is one of the key issues in the field of computer vision and remote sensing image analysis. Although many different edge-detection methods have been proposed for gray-scale, color, and multispectral images, they still face difficulties when extracting edge features from hyperspectral images (HSIs) that contain a large number of bands with very narrow gap in the spectral domain. Inspired by the clustering characteristic of the gravitational theory, a novel edge-detection algorithm for HSIs is presented in this paper. In the proposed method, we first construct a joint feature space by combining the spatial and spectral features. Each pixel of HSI is assumed to be a celestial object in the joint feature space, which exerts gravitational force to each of its neighboring pixel. Accordingly, each object travels in the joint feature space until it reaches a stable equilibrium. At the equilibrium, the image is smoothed and the edges are enhanced, where the edge pixels can be easily distinguished by calculating the gravitational potential energy. The proposed edge-detection method is tested on several benchmark HSIs and the obtained results were compared with those of four state-of-the-art approaches. The experimental results confirm the efficacy of the proposed method

NeutroAlgebra Theory, volume I

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more

Collected Papers (on Neutrosophics, Plithogenics, Hypersoft Set, Hypergraphs, and other topics), Volume X

This tenth volume of Collected Papers includes 86 papers in English and Spanish languages comprising 972 pages, written between 2014-2022 by the author alone or in collaboration with the following 105 co-authors (alphabetically ordered) from 26 countries: Abu Sufian, Ali Hassan, Ali Safaa Sadiq, Anirudha Ghosh, Assia Bakali, Atiqe Ur Rahman, Laura Bogdan, Willem K.M. Brauers, Erick González Caballero, Fausto Cavallaro, Gavrilă Calefariu, T. Chalapathi, Victor Christianto, Mihaela Colhon, Sergiu Boris Cononovici, Mamoni Dhar, Irfan Deli, Rebeca Escobar-Jara, Alexandru Gal, N. Gandotra, Sudipta Gayen, Vassilis C. Gerogiannis, Noel Batista Hernández, Hongnian Yu, Hongbo Wang, Mihaiela Iliescu, F. Nirmala Irudayam, Sripati Jha, Darjan Karabašević, T. Katican, Bakhtawar Ali Khan, Hina Khan, Volodymyr Krasnoholovets, R. Kiran Kumar, Manoranjan Kumar Singh, Ranjan Kumar, M. Lathamaheswari, Yasar Mahmood, Nivetha Martin, Adrian Mărgean, Octavian Melinte, Mingcong Deng, Marcel Migdalovici, Monika Moga, Sana Moin, Mohamed Abdel-Basset, Mohamed Elhoseny, Rehab Mohamed, Mohamed Talea, Kalyan Mondal, Muhammad Aslam, Muhammad Aslam Malik, Muhammad Ihsan, Muhammad Naveed Jafar, Muhammad Rayees Ahmad, Muhammad Saeed, Muhammad Saqlain, Muhammad Shabir, Mujahid Abbas, Mumtaz Ali, Radu I. Munteanu, Ghulam Murtaza, Munazza Naz, Tahsin Oner, ‪Gabrijela Popović‬‬‬‬‬, Surapati Pramanik, R. Priya, S.P. Priyadharshini, Midha Qayyum, Quang-Thinh Bui, Shazia Rana, Akbara Rezaei, Jesús Estupiñán Ricardo, Rıdvan Sahin, Saeeda Mirvakili, Said Broumi, A. A. Salama, Flavius Aurelian Sârbu, Ganeshsree Selvachandran, Javid Shabbir, Shio Gai Quek, Son Hoang Le, Florentin Smarandache, Dragiša Stanujkić, S. Sudha, Taha Yasin Ozturk, Zaigham Tahir, The Houw Iong, Ayse Topal, Alptekin Ulutaș, Maikel Yelandi Leyva Vázquez, Rizha Vitania, Luige Vlădăreanu, Victor Vlădăreanu, Ștefan Vlăduțescu, J. Vimala, Dan Valeriu Voinea, Adem Yolcu, Yongfei Feng, Abd El-Nasser H. Zaied, Edmundas Kazimieras Zavadskas.‬

Evolving fuzzy and neuro-fuzzy approaches in clustering, regression, identification, and classification: A Survey

Major assumptions in computational intelligence and machine learning consist of the availability of a historical dataset for model development, and that the resulting model will, to some extent, handle similar instances during its online operation. However, in many real world applications, these assumptions may not hold as the amount of previously available data may be insufficient to represent the underlying system, and the environment and the system may change over time. As the amount of data increases, it is no longer feasible to process data efficiently using iterative algorithms, which typically require multiple passes over the same portions of data. Evolving modeling from data streams has emerged as a framework to address these issues properly by self-adaptation, single-pass learning steps and evolution as well as contraction of model components on demand and on the fly. This survey focuses on evolving fuzzy rule-based models and neuro-fuzzy networks for clustering, classification and regression and system identification in online, real-time environments where learning and model development should be performed incrementally. (C) 2019 Published by Elsevier Inc.Igor Škrjanc, Jose Antonio Iglesias and Araceli Sanchis would like to thank to the Chair of Excellence of Universidad Carlos III de Madrid, and the Bank of Santander Program for their support. Igor Škrjanc is grateful to Slovenian Research Agency with the research program P2-0219, Modeling, simulation and control. Daniel Leite acknowledges the Minas Gerais Foundation for Research and Development (FAPEMIG), process APQ-03384-18. Igor Škrjanc and Edwin Lughofer acknowledges the support by the ”LCM — K2 Center for Symbiotic Mechatronics” within the framework of the Austrian COMET-K2 program. Fernando Gomide is grateful to the Brazilian National Council for Scientific and Technological Development (CNPq) for grant 305906/2014-3

Idempotent residuated structures : some category equivalences and their applications

This paper concerns residuated lattice-ordered idempotent commutative monoids that are subdirect products of chains. An algebra of this kind is a generalized Sugihara monoid (GSM) if it is generated by the lower bounds of the monoid identity; it is a Sugihara monoid if it has a compatible involution :. Our main theorem establishes a category equivalence between GSMs and relative Stone algebras with a nucleus (i.e., a closure operator preserving the lattice operations). An analogous result is obtained for Sugihara monoids. Among other applications, it is shown that Sugihara monoids are strongly amalgamable, and that the relevance logic RMt has the projective Beth de nability property for deduction.http://www.ams.org//journals/tran/hb201

Mathematical Fuzzy Logic in the Emerging Fields of Engineering, Finance, and Computer Sciences

Mathematical fuzzy logic (MFL) specifically targets many-valued logic and has significantly contributed to the logical foundations of fuzzy set theory (FST). It explores the computational and philosophical rationale behind the uncertainty due to imprecision in the backdrop of traditional mathematical logic. Since uncertainty is present in almost every real-world application, it is essential to develop novel approaches and tools for efficient processing. This book is the collection of the publications in the Special Issue “Mathematical Fuzzy Logic in the Emerging Fields of Engineering, Finance, and Computer Sciences”, which aims to cover theoretical and practical aspects of MFL and FST. Specifically, this book addresses several problems, such as:- Industrial optimization problems- Multi-criteria decision-making- Financial forecasting problems- Image processing- Educational data mining- Explainable artificial intelligence, etc

One-Variable Fragments of First-Order Many-Valued Logics

In this thesis we study one-variable fragments of first-order logics. Such a one-variable fragment consists of those first-order formulas that contain only unary predicates and a single variable. These fragments can be viewed from a modal perspective by replacing the universal and existential quantifier with a box and diamond modality, respectively, and the unary predicates with corresponding propositional variables. Under this correspondence, the one-variable fragment of first-order classical logic famously corresponds to the modal logic S5. This thesis explores some such correspondences between first-order and modal logics. Firstly, we study first-order intuitionistic logics based on linear intuitionistic Kripke frames. We show that their one-variable fragments correspond to particular modal Gödel logics, defined over many-valued S5-Kripke frames. For a large class of these logics, we prove the validity problem to be decidable, even co-NP-complete. Secondly, we investigate the one-variable fragment of first-order Abelian logic, i.e., the first-order logic based on the ordered additive group of the reals. We provide two completeness results with respect to Hilbert-style axiomatizations: one for the one-variable fragment, and one for the one-variable fragment that does not contain any lattice connectives. Both these fragments are proved to be decidable. Finally, we launch a much broader algebraic investigation into one-variable fragments. We turn to the setting of first-order substructural logics (with the rule of exchange). Inspired by work on, among others, monadic Boolean algebras and monadic Heyting algebras, we define monadic commutative pointed residuated lattices as a first (algebraic) investigation into one-variable fragments of this large class of first-order logics. We prove a number of properties for these newly defined algebras, including a characterization in terms of relatively complete subalgebras as well as a characterization of their congruences