{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T05:57:38Z","timestamp":1782367058591,"version":"3.54.5"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Finnish Centre of Excellence in Computational Inference Research (COIN)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2016,9,1]]},"DOI":"10.1109\/tbdata.2016.2557348","type":"journal-article","created":{"date-parts":[[2016,4,28]],"date-time":"2016-04-28T21:01:54Z","timestamp":1461877314000},"page":"219-233","source":"Crossref","is-referenced-by-count":16,"title":["Kvasir: Scalable Provision of Semantically Relevant Web Content on Big Data Framework"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9456-0786","authenticated-orcid":false,"given":"Liang","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sotiris","family":"Tasoulis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teemu","family":"Roos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jussi","family":"Kangasharju","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"331","article-title":"Fast approximate nearest neighbors with automatic algorithm configuration","author":"muja","year":"2009","journal-title":"Int Conf Comput Vis Theory Appl"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3_5"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540006"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2810156.2810162"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"ref35","first-page":"825","article-title":"An investigation of practical approximate nearest neighbor algorithms","author":"liu","year":"2004","journal-title":"Proc Advances Neural Inform Process Syst"},{"key":"ref34","first-page":"2052","article-title":"Can movies and books collaborate?: Cross-domain collaborative filtering for sparsity reduction","author":"li","year":"2009","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2006.12.002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"ref29","article-title":"Technical report: Fast k-nn search","author":"hyv\u00f6nen","year":"2015"},{"key":"ref2","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"airoldi","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"ref20","author":"frakes","year":"1992","journal-title":"Information Retrieval Data Structures and Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2451176.2451199"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref23","first-page":"1312","article-title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph","author":"hajebi","year":"2011","journal-title":"Int Joint Conf Artificial Intell"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"ref50","year":"0"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742825"},{"key":"ref54","first-page":"10","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"2010","journal-title":"Proc 2nd USENIX Conf Hot Topics Cloud Comput"},{"key":"ref53","first-page":"2","article-title":"Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing","author":"zaharia","year":"2012","journal-title":"Proc 9th USENIX Conf Netw Syst Des Implementation"},{"key":"ref52","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc IEEE Int Conf Comput Vision"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021240730564"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78981-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298309"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1109\/TNET.2008.2011358","article-title":"Analyzing the video popularity characteristics of large-scale user generated content systems","volume":"17","author":"cha","year":"2009","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390446"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.57"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374452"},{"key":"ref17","first-page":"237?263","article-title":"Randomized partition trees for exact nearest neighbor search","volume":"72","author":"dasgupta","year":"2013","journal-title":"Algorithmica"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741111"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0501-34"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref6","article-title":"Latent Dirichlet allocation","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1037127"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.07.021"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"ref9","first-page":"43","article-title":"Empirical analysis of predictive algorithms for collaborative filtering","author":"breese","year":"1998","journal-title":"Proc 14th Conf Uncertainty Artif Intell"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759061"},{"key":"ref45","year":"0"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004291"},{"key":"ref42","first-page":"45","article-title":"Software framework for topic modelling with large corpora","author":"rehurek","year":"2010","journal-title":"New Challenges for NLP Frameworks Workshop LREC"},{"key":"ref41","article-title":"The PageRank citation ranking: Bringing order to the web","author":"page","year":"1999"},{"key":"ref44","year":"0"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245121"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/7604042\/07462177.pdf?arnumber=7462177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:35Z","timestamp":1641987575000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7462177\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,1]]},"references-count":54,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2016.2557348","relation":{},"ISSN":["2332-7790"],"issn-type":[{"value":"2332-7790","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,1]]}}}