DBSCAN revisited: Mis-claim, un-fixability, and approximation
DBSCAN is a popular method for clustering multi-dimensional objects. Just as notable as
the method's vast success is the research community's quest for its efficient computation …
the method's vast success is the research community's quest for its efficient computation …
Privacy preserving clustering
S Jha, L Kruger, P McDaniel - … : 10th European Symposium on Research in …, 2005 - Springer
The freedom and transparency of information flow on the Internet has heightened concerns
of privacy. Given a set of data items, clustering algorithms group similar items together …
of privacy. Given a set of data items, clustering algorithms group similar items together …
An Intelligent Decision Support System Based on Multi Agent Systems for Business Classification Problem
The development of e-systems has given consumers and businesses access to a plethora of
information, which has complicated the process of decision making. Document classification …
information, which has complicated the process of decision making. Document classification …
Clustering distributed data streams in peer-to-peer environments
S Bandyopadhyay, C Giannella, U Maulik… - Information …, 2006 - Elsevier
This paper describes a technique for clustering homogeneously distributed data in a peer-to-
peer environment like sensor networks. The proposed technique is based on the principles …
peer environment like sensor networks. The proposed technique is based on the principles …
Privacy preserving clustering on horizontally partitioned data
Data mining has been a popular research area for more than a decade due to its vast
spectrum of applications. However, the popularity and wide availability of data mining tools …
spectrum of applications. However, the popularity and wide availability of data mining tools …
A scalable framework for cluster ensembles
An ensemble of clustering solutions or partitions may be generated for a number of reasons.
If the data set is very large, clustering may be done on tractable size disjoint subsets. The …
If the data set is very large, clustering may be done on tractable size disjoint subsets. The …
Multi-agent system combined with distributed data mining for mutual collaboration classification
Distributed Data Mining (DDM) has been proposed as a means to deal with the analysis of
distributed data, where DDM discovers patterns and implements prediction based on …
distributed data, where DDM discovers patterns and implements prediction based on …
On the hardness and approximation of Euclidean DBSCAN
DBSCAN is a method proposed in 1996 for clustering multi-dimensional points, and has
received extensive applications. Its computational hardness is still unsolved to this date. The …
received extensive applications. Its computational hardness is still unsolved to this date. The …
Distributed data mining and agents
JC da Silva, C Giannella, R Bhargava… - … applications of artificial …, 2005 - Elsevier
Multi-agent systems (MAS) offer an architecture for distributed problem solving. Distributed
data mining (DDM) algorithms focus on one class of such distributed problem solving tasks …
data mining (DDM) algorithms focus on one class of such distributed problem solving tasks …
A pliable index coding approach to data shuffling
L Song, C Fragouli, T Zhao - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
A promising research area that has recently emerged, is on how to use index coding to
improve the communication efficiency in distributed computing systems, especially for data …
improve the communication efficiency in distributed computing systems, especially for data …