2017
DOI: 10.1007/978-981-10-3223-3_53
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Approach to Improve the Performance of Divisive Clustering-BST

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…Along these lines, our work is orthogonal to Share mind and other puzzle sharing based arrangements. 2.1 Privacy-Preserving Data Mining Agrawal and Srikant [10], Lindell and Pinkas [11] were the first to exhibit the prospect of security protecting under data mining applications. The current PPDM techniques can broadly be orchestrated into two arrangements: (i) data disturbance and (ii) data dissemination.…”
Section: Related Work and Backgroundmentioning
confidence: 99%
See 4 more Smart Citations
“…Along these lines, our work is orthogonal to Share mind and other puzzle sharing based arrangements. 2.1 Privacy-Preserving Data Mining Agrawal and Srikant [10], Lindell and Pinkas [11] were the first to exhibit the prospect of security protecting under data mining applications. The current PPDM techniques can broadly be orchestrated into two arrangements: (i) data disturbance and (ii) data dissemination.…”
Section: Related Work and Backgroundmentioning
confidence: 99%
“…In like manner, they don't convey correct data mining happens as a result of the development of accurate hullabaloos to the data. On the other hand, Lindell and Pinkas [11] proposed the essential decision tree classifier under the two party setting tolerating the data were dispersed between them. Starting now and into the foreseeable future much work has been dispersed using SMC strategies (e.g., [12]).…”
Section: Related Work and Backgroundmentioning
confidence: 99%
See 3 more Smart Citations