2020
DOI: 10.1016/j.engappai.2020.103531
|View full text |Cite
|
Sign up to set email alerts
|

The Fast Maximum Distance to Average Vector (F-MDAV): An algorithm for k-anonymous microaggregation in big data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 39 publications
0
6
0
Order By: Relevance
“…The overall complexity of our method to match attributes and then generate clusters is O(n 2 +n). In comparison, the complexity of MDAV-based solution [38] to generate clusters is O(n 2 ), whereas the complexity to generate clusters in another scheme [6] is O(n 2 +n/k). This comparison states that the complexity to generate the clusters in our approach is not affected by the proposed methods, and it is the same as other MDAV-based solutions [6,38].…”
Section: Evaluation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The overall complexity of our method to match attributes and then generate clusters is O(n 2 +n). In comparison, the complexity of MDAV-based solution [38] to generate clusters is O(n 2 ), whereas the complexity to generate clusters in another scheme [6] is O(n 2 +n/k). This comparison states that the complexity to generate the clusters in our approach is not affected by the proposed methods, and it is the same as other MDAV-based solutions [6,38].…”
Section: Evaluation Resultsmentioning
confidence: 99%
“…In comparison, the complexity of MDAV-based solution [38] to generate clusters is O(n 2 ), whereas the complexity to generate clusters in another scheme [6] is O(n 2 +n/k). This comparison states that the complexity to generate the clusters in our approach is not affected by the proposed methods, and it is the same as other MDAV-based solutions [6,38]. However, we have improved the information loss generated as a result of these methods that preserve the utility of the anonymized data (as shown in Figure 5).…”
Section: Evaluation Resultsmentioning
confidence: 99%
“…In order to ensure the reliability and credibility of the weights taken by each evaluation index and overcome the shortcomings of a single method for weight determination, this paper uses the distance function method to organically combine the two weights for comprehensive weight determination. The distance function method uses the concept of distance function to align the degree of difference between the subjective and objective weights with the degree of difference in the corresponding distribution coefficient [36][37][38], taking into account the subjective experience of the evaluator on the actual situation, and has important statistical significance. The calculation formula is:…”
Section: Determination Of Combination Weight Based On Distance Methodsmentioning
confidence: 99%
“…The microaggregation method proposed by Rodríguez-Hoyos et al employed linear discriminant analysis to build microcells 22 . They also proposed several strategies to simplify the distance calculations and element sorting operations for data microaggregation 23 . Pallarès et al proposed an optimized prepartitioning strategy to reduce the running time of K -anonymous microaggregation on large datasets 24 .…”
Section: Related Workmentioning
confidence: 99%