In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an inte...

well as in other applications such as bioinformatics, we are interested in an angle between document vectors, hence, it is convenient to consider sets of normalized vectors. A wide variety of clustering algorithms applicable for objects of general nature exist,1 of these, the k-means algorithm might be the most widely accepted general clustering technique. In this article we suggest a new two-s...

A definition of medium voltage (MV) load diagrams was made, based on the data base knowledge discovery process. Clustering techniques were used as support for the agents of the electric power retail markets to obtain specific knowledge of their customers’ consumption habits. Each customer class resulting from the clustering operation is represented by its load diagram. The Two-step clustering a...

Zoning the pollution of a river may be the first or even the most important step in water quality management. In order to resolve its pollution, fuzzy clustering analysis may be used whenever a composite classification of water quality incorporates mutiple parameters&#10 &#10In such cases, the technique may be used as a complement or an alternative to comprehensive assessment. In fuzzy cluster...

Clustering is a technique that can effectively reduce the energy consumption of sensor nodes. In self-organizing clustering strategies, sensors elect themselves to be cluster-heads independently. This cannot guarantee the even distribution of cluster-heads over the entire sensor-network field or even the election of an optimal percentage of cluster-heads. We proposed Two-Tier Clustering in [1] ...

The two-step spectral clustering method, which consists of the Laplacian eigenmap and a rounding step, is widely used method for graph partitioning. It can be seen as natural relaxation to NP-hard minimum ratio cut problem. In this paper, we study following central question: When able find global solution problem? First, provide condition that naturally depends on intra- intercluster connectivi...