Loading…
Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment
In this most revolutionized world, the social network plays a vital role in each and everyone’s life. Social networking is a pervasive communication platform where the users can search whole over the world via the Internet. Users have similar interest to connect and interact with one another and to...
Saved in:
Published in: | Journal of network and systems management 2020-04, Vol.28 (2), p.398-422 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c319t-539e4c93a04d3ecec482f8b082f06bef2906fa7062b222e6dbafb1fd8a9a60ab3 |
---|---|
cites | cdi_FETCH-LOGICAL-c319t-539e4c93a04d3ecec482f8b082f06bef2906fa7062b222e6dbafb1fd8a9a60ab3 |
container_end_page | 422 |
container_issue | 2 |
container_start_page | 398 |
container_title | Journal of network and systems management |
container_volume | 28 |
creator | Lekshmy, P. L. Abdul Rahiman, M. |
description | In this most revolutionized world, the social network plays a vital role in each and everyone’s life. Social networking is a pervasive communication platform where the users can search whole over the world via the Internet. Users have similar interest to connect and interact with one another and to share their private and personal interest. In this paper, we examine privacy concern for the social networking users by distributed clustering method. In the proposed scheme, to speed-up, the Kernel k-means algorithm, a prototype based hybrid kernel k-means algorithm is involved in distributing the users into the cluster. Since we are using a large data set, we use a hybrid approach to speed-up the kernel k-means clustering (
HSKK
). The clustering process used here is to partition a similar set of objects in a dataset. Additionally, in the clustering process, a cryptographic protocol such as homomorphic encryption is involved in every dataset to achieve the goal to protect the private data. To prove the efficiency of the proposed approach, the experiment is done on Movie lens dataset. The experimental study of
HSKK
shows that the proposed method can significantly reduce the computation time and the private data of users is hidden from the service provider. |
doi_str_mv | 10.1007/s10922-019-09511-1 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2376094859</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2376094859</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-539e4c93a04d3ecec482f8b082f06bef2906fa7062b222e6dbafb1fd8a9a60ab3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhhdRsH78AU8Bz9FJsl85llo_aEFBPYdsdtambLNrki306i93awVvXuYdmHnfYZ4kuWJwwwCK28BAck6BSQoyY4yyo2TCskLQooDseOwhT2mRFXCanIWwBoBSyGySfD3uKm9rMu1732mzIrEjrz1iTd97EldIXrzdarMbFQP6rXUfZIHeYUsWdIPaBTJrhxDR7yfa1cTGsE9rrdHRdo5YR147Y3VL7myI3lZDxJrM3db6zm3QxYvkpNFtwMtfPU_e7-dvs0e6fH54mk2X1AgmI82ExNRIoSGtBRo0acmbsoKxQl5hwyXkjS4g5xXnHPO60k3FmrrUUuegK3GeXB9yx08_BwxRrbvBu_Gk4qLIQaZlJsctftgyvgvBY6N6bzfa7xQDtWetDqzVyFr9sFZsNImDKfR7Duj_ov9xfQMYeYPx</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2376094859</pqid></control><display><type>article</type><title>Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment</title><source>ABI/INFORM Global (ProQuest)</source><source>Springer Nature</source><source>Social Science Premium Collection (Proquest) (PQ_SDU_P3)</source><source>Library & Information Science Collection</source><creator>Lekshmy, P. L. ; Abdul Rahiman, M.</creator><creatorcontrib>Lekshmy, P. L. ; Abdul Rahiman, M.</creatorcontrib><description>In this most revolutionized world, the social network plays a vital role in each and everyone’s life. Social networking is a pervasive communication platform where the users can search whole over the world via the Internet. Users have similar interest to connect and interact with one another and to share their private and personal interest. In this paper, we examine privacy concern for the social networking users by distributed clustering method. In the proposed scheme, to speed-up, the Kernel k-means algorithm, a prototype based hybrid kernel k-means algorithm is involved in distributing the users into the cluster. Since we are using a large data set, we use a hybrid approach to speed-up the kernel k-means clustering (
HSKK
). The clustering process used here is to partition a similar set of objects in a dataset. Additionally, in the clustering process, a cryptographic protocol such as homomorphic encryption is involved in every dataset to achieve the goal to protect the private data. To prove the efficiency of the proposed approach, the experiment is done on Movie lens dataset. The experimental study of
HSKK
shows that the proposed method can significantly reduce the computation time and the private data of users is hidden from the service provider.</description><identifier>ISSN: 1064-7570</identifier><identifier>EISSN: 1573-7705</identifier><identifier>DOI: 10.1007/s10922-019-09511-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Cluster analysis ; Clustering ; Communications Engineering ; Computer Communication Networks ; Computer Science ; Computer Systems Organization and Communication Networks ; Cryptography ; Datasets ; Encryption ; Information Systems and Communication Service ; Kernels ; Networks ; Operations Research/Decision Theory ; Privacy ; Social networks ; Vector quantization</subject><ispartof>Journal of network and systems management, 2020-04, Vol.28 (2), p.398-422</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020</rights><rights>Journal of Network and Systems Management is a copyright of Springer, (2020). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-539e4c93a04d3ecec482f8b082f06bef2906fa7062b222e6dbafb1fd8a9a60ab3</citedby><cites>FETCH-LOGICAL-c319t-539e4c93a04d3ecec482f8b082f06bef2906fa7062b222e6dbafb1fd8a9a60ab3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2376094859/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2376094859?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,11668,21361,21374,27903,27904,33590,33885,36039,43712,43871,44342,73968,74156,74642</link.rule.ids></links><search><creatorcontrib>Lekshmy, P. L.</creatorcontrib><creatorcontrib>Abdul Rahiman, M.</creatorcontrib><title>Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment</title><title>Journal of network and systems management</title><addtitle>J Netw Syst Manage</addtitle><description>In this most revolutionized world, the social network plays a vital role in each and everyone’s life. Social networking is a pervasive communication platform where the users can search whole over the world via the Internet. Users have similar interest to connect and interact with one another and to share their private and personal interest. In this paper, we examine privacy concern for the social networking users by distributed clustering method. In the proposed scheme, to speed-up, the Kernel k-means algorithm, a prototype based hybrid kernel k-means algorithm is involved in distributing the users into the cluster. Since we are using a large data set, we use a hybrid approach to speed-up the kernel k-means clustering (
HSKK
). The clustering process used here is to partition a similar set of objects in a dataset. Additionally, in the clustering process, a cryptographic protocol such as homomorphic encryption is involved in every dataset to achieve the goal to protect the private data. To prove the efficiency of the proposed approach, the experiment is done on Movie lens dataset. The experimental study of
HSKK
shows that the proposed method can significantly reduce the computation time and the private data of users is hidden from the service provider.</description><subject>Algorithms</subject><subject>Cluster analysis</subject><subject>Clustering</subject><subject>Communications Engineering</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Cryptography</subject><subject>Datasets</subject><subject>Encryption</subject><subject>Information Systems and Communication Service</subject><subject>Kernels</subject><subject>Networks</subject><subject>Operations Research/Decision Theory</subject><subject>Privacy</subject><subject>Social networks</subject><subject>Vector quantization</subject><issn>1064-7570</issn><issn>1573-7705</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ALSLI</sourceid><sourceid>CNYFK</sourceid><sourceid>M0C</sourceid><sourceid>M1O</sourceid><recordid>eNp9kE1LAzEQhhdRsH78AU8Bz9FJsl85llo_aEFBPYdsdtambLNrki306i93awVvXuYdmHnfYZ4kuWJwwwCK28BAck6BSQoyY4yyo2TCskLQooDseOwhT2mRFXCanIWwBoBSyGySfD3uKm9rMu1732mzIrEjrz1iTd97EldIXrzdarMbFQP6rXUfZIHeYUsWdIPaBTJrhxDR7yfa1cTGsE9rrdHRdo5YR147Y3VL7myI3lZDxJrM3db6zm3QxYvkpNFtwMtfPU_e7-dvs0e6fH54mk2X1AgmI82ExNRIoSGtBRo0acmbsoKxQl5hwyXkjS4g5xXnHPO60k3FmrrUUuegK3GeXB9yx08_BwxRrbvBu_Gk4qLIQaZlJsctftgyvgvBY6N6bzfa7xQDtWetDqzVyFr9sFZsNImDKfR7Duj_ov9xfQMYeYPx</recordid><startdate>20200401</startdate><enddate>20200401</enddate><creator>Lekshmy, P. L.</creator><creator>Abdul Rahiman, M.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CNYFK</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M1O</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope></search><sort><creationdate>20200401</creationdate><title>Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment</title><author>Lekshmy, P. L. ; Abdul Rahiman, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-539e4c93a04d3ecec482f8b082f06bef2906fa7062b222e6dbafb1fd8a9a60ab3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Cluster analysis</topic><topic>Clustering</topic><topic>Communications Engineering</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Cryptography</topic><topic>Datasets</topic><topic>Encryption</topic><topic>Information Systems and Communication Service</topic><topic>Kernels</topic><topic>Networks</topic><topic>Operations Research/Decision Theory</topic><topic>Privacy</topic><topic>Social networks</topic><topic>Vector quantization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lekshmy, P. L.</creatorcontrib><creatorcontrib>Abdul Rahiman, M.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI-INFORM Complete</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Social Science Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Library & Information Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global (ProQuest)</collection><collection>Computing Database</collection><collection>Library Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Journal of network and systems management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lekshmy, P. L.</au><au>Abdul Rahiman, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment</atitle><jtitle>Journal of network and systems management</jtitle><stitle>J Netw Syst Manage</stitle><date>2020-04-01</date><risdate>2020</risdate><volume>28</volume><issue>2</issue><spage>398</spage><epage>422</epage><pages>398-422</pages><issn>1064-7570</issn><eissn>1573-7705</eissn><abstract>In this most revolutionized world, the social network plays a vital role in each and everyone’s life. Social networking is a pervasive communication platform where the users can search whole over the world via the Internet. Users have similar interest to connect and interact with one another and to share their private and personal interest. In this paper, we examine privacy concern for the social networking users by distributed clustering method. In the proposed scheme, to speed-up, the Kernel k-means algorithm, a prototype based hybrid kernel k-means algorithm is involved in distributing the users into the cluster. Since we are using a large data set, we use a hybrid approach to speed-up the kernel k-means clustering (
HSKK
). The clustering process used here is to partition a similar set of objects in a dataset. Additionally, in the clustering process, a cryptographic protocol such as homomorphic encryption is involved in every dataset to achieve the goal to protect the private data. To prove the efficiency of the proposed approach, the experiment is done on Movie lens dataset. The experimental study of
HSKK
shows that the proposed method can significantly reduce the computation time and the private data of users is hidden from the service provider.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10922-019-09511-1</doi><tpages>25</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1064-7570 |
ispartof | Journal of network and systems management, 2020-04, Vol.28 (2), p.398-422 |
issn | 1064-7570 1573-7705 |
language | eng |
recordid | cdi_proquest_journals_2376094859 |
source | ABI/INFORM Global (ProQuest); Springer Nature; Social Science Premium Collection (Proquest) (PQ_SDU_P3); Library & Information Science Collection |
subjects | Algorithms Cluster analysis Clustering Communications Engineering Computer Communication Networks Computer Science Computer Systems Organization and Communication Networks Cryptography Datasets Encryption Information Systems and Communication Service Kernels Networks Operations Research/Decision Theory Privacy Social networks Vector quantization |
title | Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T14%3A33%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hybrid%20Approach%20to%20Speed-Up%20the%20Privacy%20Preserving%20Kernel%20K-means%20Clustering%20and%20its%20Application%20in%20Social%20Distributed%20Environment&rft.jtitle=Journal%20of%20network%20and%20systems%20management&rft.au=Lekshmy,%20P.%20L.&rft.date=2020-04-01&rft.volume=28&rft.issue=2&rft.spage=398&rft.epage=422&rft.pages=398-422&rft.issn=1064-7570&rft.eissn=1573-7705&rft_id=info:doi/10.1007/s10922-019-09511-1&rft_dat=%3Cproquest_cross%3E2376094859%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c319t-539e4c93a04d3ecec482f8b082f06bef2906fa7062b222e6dbafb1fd8a9a60ab3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2376094859&rft_id=info:pmid/&rfr_iscdi=true |