{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:55:06Z","timestamp":1725890106641},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691549"},{"type":"electronic","value":"9783540691587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69158-7_89","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:38:15Z","timestamp":1217486295000},"page":"861-872","source":"Crossref","is-referenced-by-count":0,"title":["Pattern Discovery for High-Dimensional Binary Datasets"],"prefix":"10.1007","author":[{"given":"V\u00e1clav","family":"Sn\u00e1\u0161el","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Moravec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an","family":"H\u00fasek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Frolov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hana","family":"\u0158ezankov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Polyakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"89_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann Publishers Inc., San Francisco (1994)"},{"key":"89_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/253260.253325","volume-title":"SIGMOD 1997: Proceedings of the 1997 ACM SIGMOD international conference on Management of data","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: SIGMOD 1997: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pp. 255\u2013264. ACM Press, New York (1997)"},{"key":"89_CR3","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1091\/mbc.9.12.3273","volume":"9","author":"P.T. Spellman","year":"1998","unstructured":"Spellman, P.T., Sherlock, G., Zhang, M.Q., Anders, V.I.K., Eisen, M.B., Brown, P., Botstein, D., Futcher, B.: Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Molecular Biology of the Cell\u00a09, 3273\u20133297 (1998)","journal-title":"Molecular Biology of the Cell"},{"issue":"1","key":"89_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1132973.1132976","volume":"32","author":"M. Koyut\u00fcrk","year":"2006","unstructured":"Koyut\u00fcrk, M., Grama, A., Ramakrishnan, N.: Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis. ACM Trans. Math. Softw.\u00a032(1), 33\u201369 (2006)","journal-title":"ACM Trans. Math. Softw."},{"issue":"22","key":"89_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02331346","volume":"64","author":"P. F\u00f6ldi\u00e1k.","year":"1990","unstructured":"F\u00f6ldi\u00e1k., P.: Forming sparse representations by local anti-Hebbian learning. Biological cybernetics\u00a064(22), 165\u2013170 (1990)","journal-title":"Biological cybernetics"},{"key":"89_CR6","doi-asserted-by":"crossref","unstructured":"Frolov, A., H\u00fasek, D., Polyakov, P., \u0158ezankov\u00e1, H.: New Neural Network Based Approach Helps to Discover Hidden Russian Parliament Votting Paterns. In: International Joint Conference on Neural Networks, Omnipress, pp. 6518\u20136523 (2006)","DOI":"10.1109\/IJCNN.2006.247354"},{"issue":"3","key":"89_CR7","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TNN.2007.891664","volume":"18","author":"A.A. Frolov","year":"2007","unstructured":"Frolov, A.A., H\u00fasek, D., Muravjev, P., Polyakov, P.: Boolean Factor Analysis by Attractor Neural Network. Neural Networks, IEEE Transactions\u00a018(3), 698\u2013707 (2007)","journal-title":"Neural Networks, IEEE Transactions"},{"key":"89_CR8","doi-asserted-by":"crossref","unstructured":"Berry, M., Dumais, S., Letsche, T.: Computational Methods for Intelligent Information Access. In: Proceedings of the 1995 ACM\/IEEE Supercomputing Conference, San Diego, California, USA (1995)","DOI":"10.1145\/224170.285569"},{"key":"89_CR9","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., O\u2019Leary, D.P.: Computation and uses of the semidiscrete matrix decomposition. In: ACM Transactions on Information Processing (2000)","DOI":"10.2172\/8067"},{"key":"89_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.ipm.2004.11.005","volume":"42","author":"F. Shahnaz","year":"2006","unstructured":"Shahnaz, F., Berry, M., Pauca, P., Plemmons, R.: Document clustering using nonnegative matrix factorization. Journal on Information Processing and Management\u00a042, 373\u2013386 (2006)","journal-title":"Journal on Information Processing and Management"},{"key":"89_CR11","first-page":"793","volume":"7","author":"M.W. Spratling","year":"2006","unstructured":"Spratling, M.W.: Learning Image Components for Object Recognition. Journal of Machine Learning Research\u00a07, 793\u2013815 (2006)","journal-title":"Journal of Machine Learning Research"},{"key":"89_CR12","unstructured":"Frolov, A.A., H\u00fasek, D., Muravjev, P.: Informational efficiency of sparsely encoded Hopfield-like autoassociative memory. Optical Memory and Neural Networks (Information Optics), 177\u2013198 (2003)"},{"key":"89_CR13","unstructured":"Frolov, A.A., Sirota, A.M., H\u00fasek, D., Muravjev, P.: Binary factorization in Hopfield-like neural networks: single-step approximation and computer simulations. Neural Networks World, 139\u2013152 (2004)"},{"key":"89_CR14","doi-asserted-by":"crossref","unstructured":"Goles-Chacc, E., Fogelman-Soulie, F.: Decreasing energy functions as a tool for studying threshold networks. Discrete Mathematics, 261\u2013277 (1985)","DOI":"10.1016\/0166-218X(85)90029-0"},{"key":"89_CR15","doi-asserted-by":"crossref","unstructured":"Faloutsos, C.: Gray Codes for Partial Match and Range Queries. IEEE Transactions on Software Engineering\u00a014(10) (1988)","DOI":"10.1109\/32.6184"},{"issue":"2","key":"89_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/568271.223812","volume":"24","author":"C. Faloutsos","year":"1995","unstructured":"Faloutsos, C., Lin, K.: FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. ACM SIGMOD Record\u00a024(2), 163\u2013174 (1995)","journal-title":"ACM SIGMOD Record"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69158-7_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:28:59Z","timestamp":1620016139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69158-7_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691549","9783540691587"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69158-7_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}