{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:07:47Z","timestamp":1649174867324},"reference-count":36,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edp7329","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T22:20:52Z","timestamp":1459462852000},"page":"1139-1152","source":"Crossref","is-referenced-by-count":2,"title":["The Relevance Dependent Infinite Relational Model for Discovering Co-Cluster Structure from Relationships with Structured Noise"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Iku","family":"OHAMA","sequence":"first","affiliation":[{"name":"Advanced Research Division, Panasonic Co., Ltd."}]},{"given":"Hiromi","family":"IIDA","sequence":"additional","affiliation":[{"name":"Consumer Marketing Sector for Japan Region, Appliances Company, Panasonic Co., Ltd."}]},{"given":"Takuya","family":"KIDA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}]},{"given":"Hiroki","family":"ARIMURA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Hokkaido University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M.M. Shafiei and E.E. Milios, \u201cLatent Dirichlet co-clustering,\u201d Proc. ICDM, pp.542-551, 2006.","DOI":"10.1109\/ICDM.2006.94"},{"key":"2","unstructured":"[2] C. Kemp, J.B. Tenenbaum, T.L. Griffiths, T. Yamada, and N. Ueda, \u201cLearning systems of concepts with an infinite relational model,\u201d Proc. AAAI, pp.381-388, 2006."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] K. Nowicki and T.A.B. Snijders, \u201cEstimation and prediction for stochastic blockstructures,\u201d J. Am. Stat. Assoc., vol.96, no.455, pp.1077-1087, 2001.","DOI":"10.1198\/016214501753208735"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] H. Shan and A. Banerjee, \u201cBayesian co-clustering,\u201d Proc. ICDM, pp.530-539, 2008.","DOI":"10.1109\/ICDM.2008.91"},{"key":"5","unstructured":"[5] Z. Xu, V. Tresp, K. Yu, and H. Kriegel, \u201cInfinite hidden relational models,\u201d Proc. UAI, pp.544-551, 2006."},{"key":"6","unstructured":"[6] E.M. Airoldi, D.M. Blei, S.E. Fienberg, and E.P. Xing, \u201cMixed membership stochastic blockmodels,\u201d J. Mach. Learn. Res., vol.9, pp.1981-2014, 2008."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T.S. Ferguson, \u201cA Bayesian analysis of some nonparametric problems,\u201d The Annals of Statistics, vol.1, no.2, pp.209-230, 1973.","DOI":"10.1214\/aos\/1176342360"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. M\u00f8rup, M.N. Schmidt, and L.K. Hansen, \u201cInfinite multiple membership relational modeling for complex networks,\u201d Proc. MLSP, pp.1-6, 2011.","DOI":"10.1109\/MLSP.2011.6064546"},{"key":"9","unstructured":"[9] K. Palla, Z. Ghahramani, and D.A. Knowles, \u201cAn infinite latent attribute model for network data,\u201d Proc. ICML, pp.1607-1614, 2012."},{"key":"10","unstructured":"[10] D. Roy, C. Kemp, V. Mansinghka, and J. Tenenbaum, \u201cLearning annotated hierarchies from relational data,\u201d Proc. NIPS, pp.1185-1192, 2006."},{"key":"11","unstructured":"[11] K. Ishiguro, N. Ueda, and H. Sawada, \u201cSubset infinite relational models,\u201d Proc. AISTATS, pp.547-555, 2012."},{"key":"12","unstructured":"[12] K. Ishiguro, T. Iwata, N. Ueda, and J. Tenenbaum, \u201cDynamic infinite relational model for time-varying relational data analysis,\u201d Proc. NIPS, pp.919-927, 2010."},{"key":"13","unstructured":"[13] D.M. Roy and Y.W. Teh, \u201cThe Mondrian process,\u201d Proc. NIPS, pp.1377-1384, 2008."},{"key":"14","unstructured":"[14] M. Nakano, K. Ishiguro, A. Kimura, T. Yamada, and N. Ueda, \u201cRectangular tiling process,\u201d Proc. ICML, pp.361-369, 2014."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] I. Ohama, H. Iida, T. Kida, and H. Arimura, \u201cAn extension of the infinite relational model incorporating interaction between objects,\u201d Proc. PAKDD (2), pp.147-159, Berlin, Heidelberg, 2013.","DOI":"10.1007\/978-3-642-37456-2_13"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J.S. Liu, \u201cThe collapsed Gibbs sampler in bayesian computations with applications to a gene regulation problem,\u201d J. Am. Stat. Assoc., vol.89, no.427, pp.958-966, 1994.","DOI":"10.1080\/01621459.1994.10476829"},{"key":"17","unstructured":"[17] J. Sethuraman, \u201cA constructive definition of Dirichlet priors,\u201d Statistica Sinica, vol.4, pp.639-650, 1994."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] D. Blackwell and J. MacQueen, \u201cFerguson distributions via Polya urn schemes,\u201d The Annals of Statistics, vol.1, no.2, pp.353-355, 1973.","DOI":"10.1214\/aos\/1176342372"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] D. Aldous, \u201cExchangeability and related topics,\u201d in Ecole d'Ete de Probabilities de Saint-Flour XIII, pp.1-198, 1985.","DOI":"10.1007\/BFb0099421"},{"key":"20","unstructured":"[20] R. Salakhutdinov and A. Mnih, \u201cProbabilistic matrix factorization,\u201d Proc. NIPS, pp.1257-1264, 2007."},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] R. Salakhutdinov and A. Mnih, \u201cBayesian probabilistic matrix factorization using Markov chain Monte Carlo,\u201d Proc. ICML, pp.880-887, 2008.","DOI":"10.1145\/1390156.1390267"},{"key":"22","unstructured":"[22] D.M. Blei, A.Y. Ng, and M.I. Jordan, \u201cLatent Dirichlet allocation,\u201d J. Mach. Learn. Res., vol.3, pp.993-1022, 2003."},{"key":"23","unstructured":"[23] I. Sutskever, R. Salakhutdinov, and J.B. Tenenbaum, \u201cModelling relational data using Bayesian clustered tensor factorization,\u201d Proc. NIPS, pp.1821-1828, 2009."},{"key":"24","unstructured":"[24] A. Singh and G.J. Gordon, \u201cA Bayesian matrix factorization model for relational data,\u201d Proc. UAI, pp.556-563, 2010."},{"key":"25","unstructured":"[25] W. Li and D. Yeung, \u201cRelation regularized matrix factorization,\u201d IJCAI, pp.1126-1131, 2009."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] R. Forsati, M. Mahdavi, M. Shamsfard, and M. Sarwat, \u201cMatrix factorization with explicit trust and distrust side information for improved social recommendation,\u201d ACM Trans. Inf. Syst., vol.32, no.4, pp.17:1-17:38, 2014.","DOI":"10.1145\/2641564"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] J. Liu, C. Wu, and W. Liu, \u201cBayesian probabilistic matrix factorization with social relations and item contents for recommendation,\u201d Decision Support Systems, vol.55, no.3, pp.838-850, 2013.","DOI":"10.1016\/j.dss.2013.04.002"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] M.A. Newton, \u201cDiscovering combinations of genomic aberrations associated with cancer,\u201d J. Am. Stat. Assoc., vol.97, no.460, pp.931-942, 2002.","DOI":"10.1198\/016214502388618726"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] P.D. Hoff, \u201cSubset clustering of binary sequences, with an application to genomic abnormality data,\u201d Biometrics, vol.61, no.4, pp.1027-1036, 2005.","DOI":"10.1111\/j.1541-0420.2005.00381.x"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] M.D. Escobar and M. West, \u201cBayesian density estimation and inference using mixtures,\u201d J. Am. Stat. Assoc., vol.90, no.430, pp.577-588, 1995.","DOI":"10.1080\/01621459.1995.10476550"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] L. Hubert and P. Arabie, \u201cComparing partitions,\u201d J. of Classification, vol.2, no.1, pp.193-218, 1985.","DOI":"10.1007\/BF01908075"},{"key":"32","unstructured":"[32] MovieLens dataset, http:\/\/www.grouplens.org\/data\/, as of 2003."},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] D.N. Osherson, J. Stern, O. Wilkie, M. Stob, and E.E. Smith, \u201cDefault probability,\u201d Cognitive Science, vol.15, no.2, pp.251-269, 1991.","DOI":"10.1016\/0364-0213(91)80007-R"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] B. Klimat and Y. Yang, \u201cThe Enron corpus: A new dataset for email classification research,\u201d Proc. ECML, pp.217-226, Berlin, Heidelberg, 2004.","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] I. Ohama, T. Kida, and H. Arimura, \u201cMulti-layered framework for modeling relationships between biased objects,\u201d Proc. SDM, pp.819-827, 2015.","DOI":"10.1137\/1.9781611974010.92"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] W. Fu, L. Song, and E.P. Xing, \u201cDynamic mixed membership blockmodel for evolving networks,\u201d Proc. ICML, pp.329-336, 2009.","DOI":"10.1145\/1553374.1553416"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015EDP7329\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T04:46:03Z","timestamp":1567745163000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015EDP7329\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7329","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}