{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T01:19:35Z","timestamp":1709255975568},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,22]],"date-time":"2010-05-22T00:00:00Z","timestamp":1274486400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10462-010-9161-2","type":"journal-article","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T22:29:35Z","timestamp":1274394575000},"page":"53-72","source":"Crossref","is-referenced-by-count":9,"title":["Private predictions on hidden Markov models"],"prefix":"10.1007","volume":"34","author":[{"given":"Huseyin","family":"Polat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenliang","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahin","family":"Renckes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuf","family":"Oysal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,22]]},"reference":[{"key":"9161_CR1","unstructured":"Amirbekyan A, Estivill-Castro V (2007) A new efficient privacy-preserving scalar product protocol. In: Proceedings of the 6th Australasian conference on data mining and analytics, pp 209\u2013214, Gold Coast, Queensland, Australia, December 3\u20134"},{"key":"9161_CR2","doi-asserted-by":"crossref","unstructured":"Beaver D (1997) Commodity-based cryptography (extended abstract). In: Proceedings of the 29th annual ACM symposium on theory of computing, pp 446\u2013455, El Paso, TX, USA, May 4\u20136","DOI":"10.1145\/258533.258637"},{"key":"9161_CR3","doi-asserted-by":"crossref","unstructured":"Beaver D (1998) Server-assisted cryptography. In: Proceedings of the 1998 workshop on new security paradigms, pp 92\u2013106, Charlottesville, VA, USA, September 22\u201326","DOI":"10.1145\/310889.310923"},{"issue":"1","key":"9161_CR4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/s00037-006-0208-3","volume":"15","author":"R Beigel","year":"2006","unstructured":"Beigel R, Fortnow L, Gasarch W (2006) A nearly tight lower bound for restricted private information retrieval protocols. Comput Complex 15(1): 82\u201391","journal-title":"Comput Complex"},{"key":"9161_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-540-85093-9_8","volume":"5155","author":"H Blier","year":"2008","unstructured":"Blier H, Tapp A (2008) A single initialization server for multi-party cryptography. Lect Notes Comput Sci 5155: 71\u201385","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"9161_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10618-005-0020-8","volume":"12","author":"D Bouchaffra","year":"2006","unstructured":"Bouchaffra D, Tan J (2006) Structural hidden Markov models using a relation of equivalence: application to automotive designs. Data Min Knowl Discov 12(1): 79\u201396","journal-title":"Data Min Knowl Discov"},{"key":"9161_CR7","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume":"1592","author":"C Cachin","year":"1999","unstructured":"Cachin C, Micali S, Stadler M (1999) Computationally private information retrieval with polylogarithmic communication. Advances in Cryptology: EUROCRYPT \u201999. Lect Notes Comput Sci 1592: 402\u2013414","journal-title":"Lect Notes Comput Sci"},{"key":"9161_CR8","unstructured":"Canetti R, Ishai Y, Kumar R, Reiter MK, Rubinfeld R, Wright RN (2001) Selective private function evaluation with applications to private statistics (extended abstract). In: Proceedings of 20th Annual ACM Symposium on Principles of Distributed Computing, pp 293\u2013304, Newport, RI, USA, August 26\u201329"},{"issue":"6","key":"9161_CR9","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor B, Goldreich O, Kushilevitz E, Sudan M (1998) Private information retrieval. J ACM 45(6): 965\u2013982","journal-title":"J ACM"},{"key":"9161_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-85093-9_9","volume":"5155","author":"C Cr\u00e9peau","year":"2008","unstructured":"Cr\u00e9peau C, Wullschleger J (2008) Statistical security conditions for two-party secure function evaluation. Lect Notes Comput Sci 5155: 86\u201399","journal-title":"Lect Notes Comput Sci"},{"key":"9161_CR11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-540-87471-3_26","volume":"5262","author":"J Domingo-Ferrer","year":"2008","unstructured":"Domingo-Ferrer J, Bras-Amor\u00f3s M (2008) Peer-to-peer private information retrieval. Lect Notes Comput Sci 5262: 315\u2013323","journal-title":"Lect Notes Comput Sci"},{"key":"9161_CR12","unstructured":"Dugad R, Desai UB (1996) A tutorial on hidden Markov models. Technical Report SPANN-96.1, Indian Institute of Technology\u2013Bombay"},{"issue":"3","key":"9161_CR13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/1159892.1159900","volume":"2","author":"J Feigenbaum","year":"2006","unstructured":"Feigenbaum J, Ishai Y, Malkin T, Nissim K, Strauss M, Wright RN (2006) Secure multiparty computation of approximations. ACM Trans Algorithms 2(3): 435\u2013472","journal-title":"ACM Trans Algorithms"},{"key":"9161_CR14","doi-asserted-by":"crossref","unstructured":"Gertner Y, Ishai Y, Kushilevitz E, Malkin T (1998) Protecting data privacy in private information retrieval schemes. In: Proceedings of the 30th annual ACM symposium on theory of computing, Dallas, TX, USA, May 24\u201326","DOI":"10.1145\/276698.276723"},{"key":"9161_CR15","unstructured":"Goldreich O (2002) Secure multi-party computation. Available from http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html"},{"key":"9161_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. In: Proceedings of the 19th annual ACM symposium on theory of computing, pp 218\u2013229, New York, NY, USA, May 25\u201327","DOI":"10.1145\/28395.28420"},{"key":"9161_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser S (1997) Multi-party computations: past and present. In: Proceedings of the 16th annual ACM symposium on principles of distributed computing, pp 1\u20136, Santa Barbara, CA, USA, August 21\u201324","DOI":"10.1145\/259380.259405"},{"key":"9161_CR18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-540-78524-8_25","volume":"4948","author":"I Haitner","year":"2008","unstructured":"Haitner I, Hoch JJ, Segev G (2008) A linear lower bound on the communication complexity of single-server private information retrieval. Lect Notes Comput Sci 4948: 445\u2013464","journal-title":"Lect Notes Comput Sci"},{"key":"9161_CR19","doi-asserted-by":"crossref","unstructured":"Hassan R, Nath B (2005) Stock market forecasting using hidden Markov model: A new approach. In: Proceedings of the 2005 5th International conference on intelligent systems design and applications. Wroclaw, Poland, pp 192\u2013196, September 8\u201310","DOI":"10.1109\/ISDA.2005.85"},{"issue":"1","key":"9161_CR20","first-page":"85","volume":"1","author":"J Hsien","year":"2006","unstructured":"Hsien J, Liou Y, Chen S (2006) Road sign detection and recognition using hidden Markov model. Asian J Health Inf Sci 1(1): 85\u2013100","journal-title":"Asian J Health Inf Sci"},{"issue":"6","key":"9161_CR21","first-page":"1365","volume":"4","author":"HF Huang","year":"2008","unstructured":"Huang HF, Chang CC (2008) Low-computation oblivious transfer scheme for private information retrieval. Int J Innov Comput Inf Control 4(6): 1365\u20131370","journal-title":"Int J Innov Comput Inf Control"},{"key":"9161_CR22","unstructured":"Ioannidis I, Grama A (2003) An efficient protocol for Yaos millionaires problem. In: Proceedings of the 36th Hawaii international conference on system sciences. Big Island, HI, USA, pp 6\u20139, January 6\u20139"},{"issue":"3","key":"9161_CR23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ipl.2004.02.003","volume":"90","author":"I Kerenidis","year":"2004","unstructured":"Kerenidis I, Wolf R (2004) Quantum symmetrically-private information retrieval. Inf Process Lett 90(3): 109\u2013114","journal-title":"Inf Process Lett"},{"key":"9161_CR24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-540-85230-8_7","volume":"5143","author":"V Kolesnikov","year":"2008","unstructured":"Kolesnikov V, Schneider T (2008) A practical universal circuit construction and secure evaluation of private functions. Lect Notes Comput Sci 5143: 83\u201397","journal-title":"Lect Notes Comput Sci"},{"key":"9161_CR25","doi-asserted-by":"crossref","unstructured":"Kruger L, Jha S, Goh E, Boneh D (2006) Secure function evaluation with ordered binary decision diagrams. In: Proceedings of the 13th ACM conference on computer and communications security. Alexandria, VA, USA, pp 410\u2013420, October 30\u2013November 3","DOI":"10.1145\/1180405.1180455"},{"key":"9161_CR26","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-540-75651-4_18","volume":"4752","author":"M Layouni","year":"2007","unstructured":"Layouni M (2007) Accredited symmetrically private information retrieval. Lect Notes Comput Sci 4752: 262\u2013277","journal-title":"Lect Notes Comput Sci"},{"key":"9161_CR27","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume":"4515","author":"Y Lindell","year":"2007","unstructured":"Lindell Y, Pinkas B (2007) An efficient protocol for secure two-party computation in the presence of malicious adversaries. Lect Notes Comput Sci 4515: 52\u201378","journal-title":"Lect Notes Comput Sci"},{"key":"9161_CR28","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-540-85886-7_30","volume":"5222","author":"H Lipmaa","year":"2008","unstructured":"Lipmaa H (2008) New communication-efficient oblivious transfer protocols based on pairings. Lect Notes Comput Sci 5222: 441\u2013454","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"9161_CR29","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"U Maurer","year":"2006","unstructured":"Maurer U (2006) Secure multi-party computation made simple. Discret Appl Math 154(2): 370\u2013381","journal-title":"Discret Appl Math"},{"issue":"2","key":"9161_CR30","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1214\/105051606000000024","volume":"16","author":"E Mossel","year":"2006","unstructured":"Mossel E, Roch S (2006) Learning nonsingular phylogenies and hidden Markov models. Ann Appl Probab 16(2): 583\u2013614","journal-title":"Ann Appl Probab"},{"key":"9161_CR31","unstructured":"Naor M, Pinkas B (1999) Oblivious transfer and polynomial evaluation (extended abstract). In: Proceedings of the 31st ACM symposium on theory of computing. Atanta, GA, USA, pp 245\u2013254, May 1\u20134"},{"issue":"3","key":"9161_CR32","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10462-009-9102-0","volume":"28","author":"EM Pothos","year":"2009","unstructured":"Pothos EM (2009) Occam and Bayes in predicting category intuitiveness. Artif Intell Rev 28(3): 257\u2013274","journal-title":"Artif Intell Rev"},{"issue":"2","key":"9161_CR33","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1089\/cmb.2008.02TT","volume":"16","author":"X Qian","year":"2009","unstructured":"Qian X, Sze S, Yoon B (2009) Querying pathways in protein interaction networks based on hidden Markov models. J Comput Biol 16(2): 145\u2013157","journal-title":"J Comput Biol"},{"issue":"4","key":"9161_CR34","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1080\/03091900600968908","volume":"32","author":"J Rasku","year":"2008","unstructured":"Rasku J, Juhola M, Tossavainen T, Pyykko I, Toppila S (2008) Modelling stabilograms with hidden Markov models. J Med Eng Technol 32(4): 273\u2013283","journal-title":"J Med Eng Technol"},{"issue":"4","key":"9161_CR35","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10462-009-9106-9","volume":"28","author":"S Renckes","year":"2008","unstructured":"Renckes S, Polat H, Oysal Y (2008) Providing predictions on distributed HMMs with privacy. Artif Intell Rev 28(4): 343\u2013362","journal-title":"Artif Intell Rev"},{"issue":"2","key":"9161_CR36","first-page":"687","volume":"2","author":"RB Scharpf","year":"2008","unstructured":"Scharpf RB, Parmigiani G, Pevsner J, Ruczinski I (2008) Hidden Markov models for the assessment of chromosomal alterations using high-throughput SNP arrays. Ann Appl Probab 2(2): 687\u2013713","journal-title":"Ann Appl Probab"},{"key":"9161_CR37","unstructured":"Sion R, Carbunar B (2007) On the computational practicality of private information retrieval. In: Proceedings of the network and distributed systems security symposium. San Diego, CA, USA, February 28\u2013 March 2"},{"issue":"1","key":"9161_CR38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.eswa.2005.11.022","volume":"32","author":"B Tso","year":"2007","unstructured":"Tso B, Chang PY (2007) Mining free-structured information based on hidden Markov models. Expert Syst Appl 32(1): 97\u2013102","journal-title":"Expert Syst Appl"},{"key":"9161_CR39","unstructured":"van der Putten P, van Someren M (2000) CoIL challenge 2000: the insurance company case. Technical Report 2000\u201309, Leiden Institute of Advanced Computer Science, Amsterdam"},{"key":"9161_CR40","doi-asserted-by":"crossref","unstructured":"Wang IC, Shen CH, Hsu TS, Liao CC, Wang DW, Zhan J (2008) Towards empirical aspects of secure scalar product. In: Proceedings of the 2008 international conference on information security and assurance. Busan, Korea, pp 573\u2013578, April 24\u201326","DOI":"10.1109\/ISA.2008.78"},{"key":"9161_CR41","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.eswa.2007.10.045","volume":"36","author":"LC Wu","year":"2009","unstructured":"Wu LC, Huang HD, Chang YC, Lee YC, Horng JT (2009) Detecting LTR structures in human genomic sequences using profile hidden Markov models. Expert Syst Appl 36: 668\u2013674","journal-title":"Expert Syst Appl"},{"issue":"1","key":"9161_CR42","first-page":"47","volume":"21","author":"Z Yang","year":"2006","unstructured":"Yang Z, Wright RN, Subramaniam H (2006) Experimental analysis of a privacy-preserving scalar product protocol. Int J Comput Syst Sci Eng 21(1): 47\u201352","journal-title":"Int J Comput Syst Sci Eng"},{"key":"9161_CR43","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: Proceedings of the 23rd annual symposium on foundations of computer science. Chicago, IL, USA, pp 160\u2013164, November 3\u20135","DOI":"10.1109\/SFCS.1982.38"},{"key":"9161_CR44","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1007\/978-3-540-74272-2_103","volume":"4673","author":"WC Yau","year":"2007","unstructured":"Yau WC, Kumar DK, Weghorn H (2007) Visual speech recognition using motion features and hidden Markov models. Lect Notes Comput Sci 4673: 832\u2013839","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"9161_CR45","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1177\/0165551508092257","volume":"35","author":"K Yi","year":"2009","unstructured":"Yi K, Beheshti J (2009) A hidden Markov model-based text classification of medical documents. J Inf Sci 35(1): 67\u201381","journal-title":"J Inf Sci"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9161-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-010-9161-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-010-9161-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:08Z","timestamp":1559137508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-010-9161-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,22]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9161"],"URL":"https:\/\/doi.org\/10.1007\/s10462-010-9161-2","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,22]]}}}