Learn More
By applying several clustering algorithms to a dataset E or the same algorithm with different parameters, we get several partitions of the dataset E. The problem of finding the best partition among these partitions is considered in this paper. The best partition, also called as consensus partition, minimizes the average number of disagreements between all(More)
Web applications involve the operations on the data objects across the organization boundaries. The operations are provided by the organization once the partners are identified. Web services are globally accepted and are adopted in any web application. The serious threat in web services is security, as these services are available to open world. In this(More)
The subspace clustering algorithm CLIQUE finds all subspace clusters including overlapping clusters existing in high dimensional datasets. CLIQUE consists of three main steps namely - (1) identification of subspaces that contain clusters, (2) identification of clusters and (3) generation of the minimal description for the clusters obtained in step two. In(More)