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.
Software evolves and thus developers frequently make changes to systems that are logged in version control systems. These changes are often poorly documented -- often commit logs are empty or only contain minimal information. Thus, it is often a challenge to understand why certain changes are made especially if they were introduced many months or even years ago. Understanding these changes is important...
This article presents the next experiments we will conduct on the interaction model of EmotiRob project. It describes the first experimentation we had done, the experimental protocol and the evaluation grid.
Numerous data mining methods have been designed to help extract relevant and significant information from large datasets. Computing concept lattices allows clustering data according to their common features and making all relationships between them explicit. However, the size of such lattices increases exponentially with the volume of data and its number of dimensions. This paper proposes to use spatial...
There are many methods which have been developed for improvement of time in mining frequent itemsets. However, the methods which deal with the time of mining association rules were not put in deep research. In reality, in case of database which contains many frequent itemsets (from ten thousands up to millions), the time of mining association rules is much larger than that needed for mining frequent...
The number of frequent closed itemsets (FCIs) are usually fewer than numbers of frequent itemsets. However, it is necessary to find minimal generators (mGs) for mining association rule from them. The finding mGs approaches based on generating candidate lose timeliness when the number of frequent closed itemsets are large. In this paper, we present MG-CHARM, an efficient algorithm for finding all mGs...
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.