Marco Detchart, Cedric
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
Marco Detchart
First Name
Cedric
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
ORCID
person.page.observainves
person.page.upna
Name
- Publications
- item.page.relationships.isAdvisorOfPublication
- item.page.relationships.isAdvisorTFEOfPublication
- item.page.relationships.isAuthorMDOfPublication
2 results
Search Results
Now showing 1 - 2 of 2
Publication Open Access On generalized overlap and grouping indices in n-dimensional contexts(Springer, 2025-05-08) Asmus, Tiago da Cruz; Dimuro, Graçaliz Pereira; Lucca, Giancarlo; Marco Detchart, Cedric; Santos, Helida; Camargo, Heloisa A.; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaOverlap and grouping indices are functions measuring, respectively, the fuzzy intersection and fuzzy union of two fuzzy sets. They have been applied successfully in several fields, such as in interpolative fuzzy systems, fuzzy rule-based classification systems and comparison of fuzzy inference rules. Overlap and grouping indices can be built employing overlap and grouping functions, respectively, which are possibly non-associative aggregation functions with features that provide good results when applied to practical bivariate problems. Many studies have generalized the concepts of overlap and grouping functions to be applied in n-dimensional problems. However, the concepts of overlap/grouping indices have not been generalized in similar pattern. Since the associative property may not hold, their application in n-dimensional domains, for comparing more than two fuzzy sets at a time, is not immediate, which limit their application in such contexts. The objective of this paper is to introduce the concepts of n-dimensional and general overlap/grouping indices, with special attention to the development of their construction methods based on generalized overlap/grouping functions. As an application example, we introduce the concept of n-dimensional Jaccard index, with a construction method based on n-dimensional overlap/grouping indices, providing an n-dimensional fuzzy set similarity score.Publication Open Access Data stream clustering: introducing recursively extendable aggregation functions for incremental cluster fusion processes(IEEE, 2025-03-07) Urío Larrea, Asier; Camargo, Heloisa A.; Lucca, Giancarlo; Asmus, Tiago da Cruz; Marco Detchart, Cedric; Schick, L.; López Molina, Carlos; Andreu-Pérez, Javier; Bustince Sola, Humberto; Dimuro, Graçaliz Pereira; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISCIn data stream (DS) learning, the system has to extract knowledge from data generated continuously, usually at high speed and in large volumes, making it impossible to store the entire set of data to be processed in batch mode. Hence, machine learning models must be built incrementally by processing the incoming examples, as data arrive, while updating the model to be compatible with the current data. In fuzzy DS clustering, the model can either absorb incoming data into existing clusters or initiate a new cluster. As the volume of data increases, there is a possibility that the clusters will overlap to the point where it is convenient to merge two or more clusters into one. Then, a cluster comparison measure (CM) should be applied, to decide whether such clusters should be combined, also in an incremental manner. This defines an incremental fusion process based on aggregation functions that can aggregate the incoming inputs without storing all the previous inputs. The objective of this article is to solve the fuzzy DS clustering problem of incrementally comparing fuzzy clusters on a formal basis. First, we formalize and operationalize incremental fusion processes of fuzzy clusters by introducing recursively extendable (RE) aggregation functions, studying construction methods and different classes of such functions. Second, we propose two approaches to compare clusters: 1) similarity and 2) overlapping between clusters, based on RE aggregation functions. Finally, we analyze the effect of those incremental CMs on the online and offline phases of the well-known fuzzy clustering algorithm d-FuzzStream, showing that our new approach outperforms the original algorithm and presents better or comparable performance to other state-of-the-art DS clustering algorithms found in the literature.