Yayın:
A scalable privacy-preserving recommendation scheme via bisecting k-means clustering

Sadeleştirilmiş öğe sayfası
dc.contributor.authorBilge, Alper
dc.contributor.authorPolat, Hüseyin
dc.contributor.orcid0000-0003-3467-9915
dc.contributor.orcid0000-0003-4128-2625
dc.date.accessioned2025-11-13T09:26:07Z
dc.date.issued2013-03-27
dc.identifier.doihttps://doi.org/10.1016/j.ipm.2013.02.004
dc.identifier.endpage927
dc.identifier.issn0306-4573
dc.identifier.issue4
dc.identifier.openalexW2080937027
dc.identifier.startpage912
dc.identifier.urihttps://hdl.handle.net/11421/1132
dc.identifier.urihttps://doi.org/10.1016/j.ipm.2013.02.004
dc.identifier.volume49
dc.language.isoen
dc.relation.ispartofInformation Processing & Management
dc.rightsrestrictedAccess
dc.subjectComputer science
dc.subjectScalability
dc.subjectCluster analysis
dc.subjectPreprocessor
dc.subjectCollaborative filtering
dc.subjectData mining
dc.subjectScheme (mathematics)
dc.subjectInformation privacy
dc.subjectBenchmark (surveying)
dc.subjectMachine learning
dc.subjectRecommender system
dc.subjectArtificial intelligence
dc.subjectInformation retrieval
dc.subjectDatabase
dc.subject.sdg16
dc.titleA scalable privacy-preserving recommendation scheme via bisecting k-means clustering
dc.typeArticle
dspace.entity.typePublication
local.authorid.openalexA5042038212
local.authorid.openalexA5029891409

Dosyalar

Koleksiyonlar

Publications