FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2085180935> ?p ?o ?g. }

• W2085180935 endingPage "12" @default.
• W2085180935 startingPage "1" @default.
• W2085180935 abstract "In privacy preserving data mining, the <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M2><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:math>-diversity and <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M3><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>-anonymity models are the most widely used for preserving the sensitive private information of an individual. Out of these two, <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M4><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:math>-diversity model gives better privacy and lesser information loss as compared to the <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M5><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>-anonymity model. In addition, we observe that numerous clustering algorithms have been proposed in data mining, namely, <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M6><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>-means, PSO, ACO, and BFO. Amongst them, the BFO algorithm is more stable and faster as compared to all others except <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M7><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:math>-means. However, BFO algorithm suffers from poor convergence behavior as compared to other optimization algorithms. We also observed that the current literature lacks any approaches that apply BFO with <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M8><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:math>-diversity model to realize privacy preservation in data mining. Motivated by this observation, we propose here an approach that uses fractional calculus (FC) in the chemotaxis step of the BFO algorithm. The FC is used to boost the computational performance of the algorithm. We also evaluate our proposed FC-BFO and BFO algorithms empirically, focusing on information loss and execution time as vital metrics. The experimental evaluation shows that our proposed FC-BFO algorithm derives an optimal cluster as compared to the original BFO algorithm and existing clustering algorithms." @default.
• W2085180935 created "2016-06-24" @default.
• W2085180935 creator A5028565396 @default.
• W2085180935 creator A5044371525 @default.
• W2085180935 date "2014-09-16" @default.
• W2085180935 modified "2023-10-11" @default.
• W2085180935 title "A Clustering Approach for the <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML id=M1><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:math>-Diversity Model in Privacy Preserving Data Mining Using Fractional Calculus-Bacterial Foraging Optimization Algorithm" @default.
• W2085180935 cites W1504717097 @default.
• W2085180935 cites W1964437930 @default.
• W2085180935 cites W1985313039 @default.
• W2085180935 cites W2018052006 @default.
• W2085180935 cites W2036258737 @default.
• W2085180935 cites W2040469380 @default.
• W2085180935 cites W2047370889 @default.
• W2085180935 cites W2154929945 @default.
• W2085180935 cites W2159024459 @default.
• W2085180935 doi "https://doi.org/10.1155/2014/396529" @default.
• W2085180935 hasPublicationYear "2014" @default.
• W2085180935 type Work @default.
• W2085180935 sameAs 2085180935 @default.
• W2085180935 citedByCount "89" @default.
• W2085180935 countsByYear W20851809352016 @default.
• W2085180935 countsByYear W20851809352017 @default.
• W2085180935 countsByYear W20851809352018 @default.
• W2085180935 countsByYear W20851809352019 @default.
• W2085180935 countsByYear W20851809352020 @default.
• W2085180935 countsByYear W20851809352021 @default.
• W2085180935 countsByYear W20851809352022 @default.
• W2085180935 countsByYear W20851809352023 @default.
• W2085180935 crossrefType "journal-article" @default.
• W2085180935 hasAuthorship W2085180935A5028565396 @default.
• W2085180935 hasAuthorship W2085180935A5044371525 @default.
• W2085180935 hasBestOaLocation W20851809351 @default.
• W2085180935 hasConcept C11413529 @default.
• W2085180935 hasConcept C119857082 @default.
• W2085180935 hasConcept C154945302 @default.
• W2085180935 hasConcept C41008148 @default.
• W2085180935 hasConceptScore W2085180935C11413529 @default.
• W2085180935 hasConceptScore W2085180935C119857082 @default.
• W2085180935 hasConceptScore W2085180935C154945302 @default.
• W2085180935 hasConceptScore W2085180935C41008148 @default.
• W2085180935 hasLocation W20851809351 @default.
• W2085180935 hasOpenAccess W2085180935 @default.
• W2085180935 hasPrimaryLocation W20851809351 @default.
• W2085180935 hasRelatedWork W2961085424 @default.
• W2085180935 hasRelatedWork W3046775127 @default.
• W2085180935 hasRelatedWork W3170094116 @default.
• W2085180935 hasRelatedWork W4205958290 @default.
• W2085180935 hasRelatedWork W4225307033 @default.
• W2085180935 hasRelatedWork W4285260836 @default.
• W2085180935 hasRelatedWork W4286629047 @default.
• W2085180935 hasRelatedWork W4306321456 @default.
• W2085180935 hasRelatedWork W4306674287 @default.
• W2085180935 hasRelatedWork W4224009465 @default.
• W2085180935 hasVolume "2014" @default.
• W2085180935 isParatext "false" @default.
• W2085180935 isRetracted "false" @default.
• W2085180935 magId "2085180935" @default.
• W2085180935 workType "article" @default.