{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:17:32Z","timestamp":1730200652208,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,17]]},"DOI":"10.1109\/bigdata55660.2022.10021104","type":"proceedings-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T19:35:23Z","timestamp":1674761723000},"page":"5871-5880","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Data Analytics on Augmented Similarity Triplets"],"prefix":"10.1109","author":[{"given":"Sarwan","family":"Ali","sequence":"first","affiliation":[{"name":"Georgia State University,Atlanta,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Lahore University of Management Science,Lahore,Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umair Ul","family":"Hassan","sequence":"additional","affiliation":[{"name":"2B 6VYCCM KNUniversity of Galway,Galway,Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Asad Khan","sequence":"additional","affiliation":[{"name":"Hazara University,Mansehra,Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shafiq","family":"Alam","sequence":"additional","affiliation":[{"name":"Massey University,Auckland,New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imdadullah","family":"Khan","sequence":"additional","affiliation":[{"name":"Lahore University of Management Science,Lahore,Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"11","article-title":"Generalized non-metric multidimensional scaling","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Agarwal"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2022.3206284"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3442390"},{"key":"ref4","first-page":"1472","article-title":"Multiview triplet embedding: Learning attributes in multiple maps","volume-title":"International Conference on Machine Learning","author":"Amid"},{"key":"ref5","first-page":"1","volume":"abs\/1611.09957","author":"Amid","year":"2016","journal-title":"t-exponential triplet embedding"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3150\/15-BEJ792"},{"key":"ref7","first-page":"1020","article-title":"Structured adaptive and random spinners for fast machine learning computations","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Bojarski"},{"key":"ref8","first-page":"1","article-title":"Learning to search efficiently using comparisons","author":"Chumbalov","year":"2019"},{"volume-title":"Introduction to Algorithms","year":"2009","author":"Cormen","key":"ref9"},{"key":"ref10","article-title":"Sparse multidimensional scaling using landmark points","volume-title":"Tech. rep., Stanford University","author":"De Silva","year":"2004"},{"key":"ref11","first-page":"6935","article-title":"Efficient approximation algorithms for strings kernel based sequence classification","author":"Farhan","year":"2017","journal-title":"Neural Information Processing Systems"},{"key":"ref12","first-page":"7454","article-title":"Foundations of comparison-based hierarchical clustering","volume-title":"Conference on Neural Information Processing Systems, NeurIPS","author":"Ghoshdastidar"},{"key":"ref13","first-page":"558","article-title":"Crowdclustering","author":"Gomes","year":"2011","journal-title":"Neural Information Processing Systems, NeurIPS"},{"key":"ref14","first-page":"1866","article-title":"Comparison-based random forests","volume-title":"International Conference on Machine Learning","author":"Haghiri"},{"key":"ref15","first-page":"851","article-title":"Comparison-based nearest neighbor search","volume-title":"International Conference on Artificial Intelligence and Statistics, AISTATS","author":"Haghiri"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v1i1.13079"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.31"},{"key":"ref18","first-page":"2703","article-title":"Finite sample prediction and recovery bounds for ordinal embedding","volume-title":"Conference on Neural Information Processing Systems, NeurIPS","author":"Jain"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120287"},{"key":"ref20","first-page":"6807","article-title":"Kernel functions based on triplet comparisons","volume-title":"Conference on Neural Information Processing Systems, NeurIPS","author":"Kleindessner"},{"key":"ref21","first-page":"58:1","article-title":"Lens depth function and k-relative neighborhood graph: Versatile tools for ordinal data analysis","author":"Kleindessner","year":"2017","journal-title":"Journal of Machine Learning Research 18"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1167\/16.12.719"},{"key":"ref23","first-page":"3905","article-title":"Towards a unified analysis of random fourier features","volume-title":"International Conference on Machine Learning, ICML","author":"Li"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213878"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/255"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.1883"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.112.4.881"},{"key":"ref30","first-page":"3383","article-title":"But how does it work in theory? linear SVM with random features","volume-title":"Conference on Neural Information Processing Systems, NeurIPS","author":"Sun"},{"key":"ref31","first-page":"673","article-title":"Adaptively learning the crowd kernel","volume-title":"International Conference on Machine Learning, ICML","author":"Tamuz"},{"key":"ref32","first-page":"847","article-title":"Local ordinal embedding","volume-title":"International Conference on Machine Learning, ICML","author":"Terada"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.148"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v3i1.13232"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v2i1.13152"}],"event":{"name":"2022 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2022,12,17]]},"location":"Osaka, Japan","end":{"date-parts":[[2022,12,20]]}},"container-title":["2022 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10020192\/10020156\/10021104.pdf?arnumber=10021104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T07:46:08Z","timestamp":1707810368000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10021104\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/bigdata55660.2022.10021104","relation":{},"subject":[],"published":{"date-parts":[[2022,12,17]]}}}