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.
For very large databases, such as spatial database and multimedia database, the traditional clustering algorithms are of limitations in validity and scalability. According to the notion of clustering feature of BIRCH, an incremental clustering algorithm is designed and implemented, which solves the problems of effectiveness, space and time complexities of clustering algorithms for very large spatial...
The researches and applications on ant colony algorithm have made great progress in recent years. A number of results have proved the validity of the algorithm and its advantages in some fields. However, its basic shortcomings, which are long searching time and easily jumping into local optimal solution, have not been completely solved. This paper analyzes the reasons of stagnation and then introduces...
The traditional clustering algorithms are only suitable for the static datasets. As for the dynamic and incremental datasets, the clustering results will become unreliable after data updates, and also it will certainly decrease efficiency and waste computing resources to cluster all of the data again. To overcome these problems, a new incremental clustering algorithm is proposed on the basis of density...
This paper studies hybrid dynamical evolutionary algorithm in the context of classification rule discovery. Nature inspired search algorithms such as genetic algorithms, Ant colonies and particle swarm optimization have been previously studied on data mining tasks, in particular, classification rule discovery. We extended this work by applying a hybrid algorithm which combines dynamical evolutionary...
The dynamical evolutionary algorithm is that all individuals in a population (called as particles in a dynamical system) are running and searching along with their population evolving driven by a new select mechanism. In this paper, rank-based selection is proposed for the dynamical evolutionary algorithm. The method applies rank-based selection to replace half of the lower fitness population with...
In this paper, a degree priority routing algorithm is proposed to minimize the hardware cost for nonregular mesh network-on-chip. In the algorithm, the routing path is dynamically selected with respective to the communication status of the next hop node. The next hop node concluded by the degree priority routing different with them obtained by routing algorithm are inserted in the routing table. And,...
In the paper, a cross chaotic map using Logistic map and Chebyshev map is presented. With the exceptionally desirable properties of non-periodical motion and non-convergence of chaos, scheme for image encryption has suggested a new and efficient way to deal with the intractable problem of fast and highly secure image. In order to realize image encryption, every pixel of image is randomly changed according...
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.