The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Geospatial databases generally consist of measurements related to points (or pixels in the case of raster data), lines, and polygons. In recent years, the size and complexity of these databases have increased significantly and they often contain duplicate records, i.e., two or more close records representing the same measurement result. In this paper, we address the problem of detecting duplicates...
It is well known that interval computations are very important, both by themselves (as a method for processing data known with interval uncertainty) and as a way to process fuzzy data. In general, the problem of computing the range of a given function under interval uncertainty is computationally difficult (NP-hard). As a result, there exist different methods for estimating such a range: some methods...
In traditional statistics, we usually assume that we know the exact probability distributions. In practice, we often only know the probabilities with interval uncertainty. The main emphasis on taking this uncertainty into account has been on situations in which we know a cumulative distribution function (cdf) with interval uncertainty. However, in some cases, we know the probability density function...
Within the classification algorithms based on signed fuzzy measures, an obvious limitation is the complexity of the algorithms due to the large number of interactions among attributes. For a data set with n attributes, the complexity of classification algorithm would be O (2n). But in the practical problems, the higher-order interactions among attributes are often not significant enough to the classification...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.