Subspace clustering discovers the clusters embedded in multiple, overlapping subspaces of high dimensional data. Many significant subspace clustering algorithms exist, each having different characteristics caused by the use of different techniques, assumptions, heuristics used etc. A comprehensive classification scheme is essential which will consider all such characteristics to divide subspace...

In this article, the effective circuit partitioning techniques are employed by using the clustering algorithms. The technique uses the circuit netlist in order to cluster the circuit in partitioning steps and it also minimizes the interconnection distance with the required iteration level. The clustering algorithm like K-Mean, Y-Mean, K-Medoid are performed on the standard benchmark circuits. T...

Medical image segmentation demands a segmentation algorithm which works against noise. The most popular algorithm used in image segmentation is Fuzzy C-Means clustering. It uses only intensity values for clustering which makes it highly sensitive to noise. The comparison of the three fundamental image segmentation methods based on fuzzy logic namely Fuzzy C-Means (FCM), Intuitionistic Fuzzy C-M...

Many graph clustering algorithms have been proposed in recent past researches, each algorithm having its own advantages and drawbacks. All these algorithms rely on a very different approach so it’s really hard to say that which one is the most efficient and optimal if we talk in the sense of performance. It is really hard to decide that which algorithm is beneficial in case of highly complex ne...

As the heavy duty truck market becomes more competitive the importance of quick and cheap repairs increases. However, to find and repair the faulty component constitutes cumbersome and expensive work and it is not uncommon that the troubleshooting process results in unnecessary expenses. To repair the truck in a cost effective fashion a troubleshooting strategy that chooses actions according to...

The MaxSAT problem and some of its well-known variants find an increasing number of practical applications in a wide range of areas. Examples include different optimization problems in system design and verification. However, most MaxSAT problem instances from these practical applications are too hard for existing branch and bound algorithms. One recent alternative to branch and bound MaxSAT al...

In mobile environments, mobile device users access and transfer a great deal of data through the online servers. In order to enhance users’ access speed in a wireless network, decentralizing replicated servers appropriately in the network is required. Previous work regarding this issue had focused on the placement of replicated servers along with the moving paths of the users to maximize the hi...

In this demonstration, we will show the different modules related to the automatic surveillance prototype developed in the context of the EU VANAHEIM project. Several components will be demonstrated on real data from the Torino metro. First, different unsupervised activity modeling algorithms that capture recurrent activities from long recordings will be illustrated. A contrario, they provide u...

In a recent paper by Tang, Reed and Wagener (2006, hereafter referred to as TRW) a comparison assessment was presented of three state-of-the-art evolutionary algorithms for multiobjective calibration of hydrologic models. Through three illustrative case studies, TRW demonstrate that the Strength Pareto Evolutionary Algorithm 2 (SPEA2) and Epsilon Dominance Nondominated Sorted Genetic Algorithm ...