2,979 publications from this institution
Abstract This article is categorized under: Algorithmic Development > Biological Data Mining Algorithmic Development > Spatial and Temporal Data Mining Application Areas > Health Care Technologies > Structure Discovery and Clustering
The notion of distributed interval, as a formal framework for information granulation, represented by the collection of finite number of general-intervals is introduced. Operations on distributed intervals are defined based on the corresponding general-intervals'. Distributed intervals provide a bi-criteria framework for information granulation that can be used as a conceptually rich structure in granular computing.
Network and information security are regarded as some of the most pressing problems of contemporary economy, affecting both individual citizens and entire societies, making them a highlight for homeland security. Innovative approaches to handle this challenge are undertaken by the scientific community, proposing the utilization of the emerging, advanced machine learning methods. This very paper puts forward a novel approach to the detection of cyberattacks taking inventory of the practical application of information granules. The feasibility of utilizing Granular Computing (GC) as a solution to the most current challenges in cybersecurity is researched. To the best of our knowledge, granular computing has not yet been widely examined or used for cybersecurity application purposes. The major contribution of this work is a method for constructing information granules from network data. We then report promising results on a benchmark dataset.
People recognize familiar faces in a similar way by using interior facial features (facial regions) such as eyes, nose, mouth, etc. However, the importance of these regions in the realization of face identification and a quantification of the impact of such regions on the recognition process could vary from one region to another. An intuitively appealing observation is that of monotonicity: the more regions are taken into account in the recognition process, the better. From a formal point of view, the relevance of the facial regions and an aggregation of these pieces of experimental evidence can be described in the formal setting of fuzzy measures. Fuzzy measures are of particular interest with this regard given their monotonicity property (which stands in a clear contrast with the more restrictive additivity property inherent to probability–like measures). In this study, we concentrate on the construction of fuzzy measures (more specifically, $$ \lambda $$ -fuzzy measure) and characterize their performance in the problem of face recognition using a collection of experimental data.