{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:08:36Z","timestamp":1725556116234},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642136719"},{"type":"electronic","value":"9783642136726"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_2","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T14:38:17Z","timestamp":1274193497000},"page":"14-26","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Knowledge Discovery with Non Linear Dimensionality Reduction"],"prefix":"10.1007","author":[{"given":"Panagis","family":"Magdalinos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dialecti","family":"Valsamou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Abu-Khzam, F.N., Samatova, N.F., Ostrouchov, G., Langston, M.A., Geist, A.: Distributed dimension reduction algorithms for widely dispersed data. In: IASTED PDCS, pp. 167\u2013174 (2002)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM\u00a051(1) (2008)","DOI":"10.1145\/1327452.1327494"},{"issue":"12","key":"2_CR3","first-page":"1624","volume":"17","author":"D. Cai","year":"2005","unstructured":"Cai, D., He, X., Han, J.: Document clustering using locality preserving indexing. IEEE TKDE\u00a017(12), 1624\u20131637 (2005)","journal-title":"IEEE TKDE"},{"key":"2_CR4","volume-title":"Mining the Web: Discovering Knowledge from Hypertext Data","author":"S. Chakrabarti","year":"2002","unstructured":"Chakrabarti, S.: Mining the Web: Discovering Knowledge from Hypertext Data. Morgan Kaufmann, San Francisco (2002)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Gu, Q., Zhou, J.: Local relevance weighted maximum margin criterion for text classification. In: SIAM SDM, pp. 1135\u20131146 (2009)","DOI":"10.1137\/1.9781611972795.97"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Haghani, P., Michel, S., Aberer, K.: Distributed similarity search in high dimensions using locality sensitive hashing. In: ACM EDBT, pp. 744\u2013755 (2009)","DOI":"10.1145\/1516360.1516446"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Henry, G., Geijn, R.: Parallelizing the qr algorithm for the unsymmetric algebraic eigenvalue problem. In: SIAM JSC, pp. 870\u2013883 (1994)","DOI":"10.1137\/0917056"},{"key":"2_CR8","unstructured":"Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: VLDB, pp. 506\u2013515 (2000)"},{"key":"2_CR9","unstructured":"Kargupta, H., Huang, W., Sivakumar, K., Park, B.H., Wang, S.: Collective pca from distributed heterogeneous data. In: PKDD (2000)"},{"key":"2_CR10","volume-title":"Computer Networking: A Top-Down Approach Featuring the Internet","author":"J.F. Kurose","year":"2000","unstructured":"Kurose, J.F., Ross, K.W.: Computer Networking: A Top-Down Approach Featuring the Internet. Addison-Wesley, Reading (2000)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Magdalinos, P., Doulkeridis, C., Vazirgiannis, M.: K-landmarks: Distributed dimensionality reduction for clustering quality maintenance. In: PKDD, pp. 322\u2013334 (2006)","DOI":"10.1007\/11871637_32"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Magdalinos, P., Doulkeridis, C., Vazirgiannis, M.: Fedra: A fast and efficient dimensionality reduction algorithm. In: SIAM SDM, pp. 509\u2013520 (2009)","DOI":"10.1137\/1.9781611972795.44"},{"key":"2_CR13","first-page":"327","volume-title":"SDMKD, ch. 19","author":"H. Qi","year":"2004","unstructured":"Qi, H., Wang, T., Birdwell, D.: Global pca for dimensionality reduction in distributed data mining. In: SDMKD, ch. 19, pp. 327\u2013342. CRC, Boca Raton (2004)"},{"key":"2_CR14","unstructured":"Qu, Y., Ostrouchov, G., Samatova, N., Geist, A.: Pca for dimensionality reduction in massive distributed data sets. In: 5th International Workshop on High Performance Data Mining (2002)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: ACM SIGCOMM, pp. 161\u2013172 (2001)","DOI":"10.1145\/964723.383072"},{"key":"2_CR16","unstructured":"de Silva, V., Tenenbaum, J.B.: Global versus local methods in nonlinear dimensionality reduction. In: NIPS, pp. 705\u2013712 (2002)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F.M., Hari: Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383071"},{"issue":"5500","key":"2_CR18","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"J.B. Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science\u00a0290(5500), 2319\u20132323 (2000)","journal-title":"Science"},{"key":"2_CR19","volume-title":"Theory and methods of scaling","author":"W.S. Togerson","year":"1958","unstructured":"Togerson, W.S.: Theory and methods of scaling. Wiley, Chichester (1958)"},{"issue":"1","key":"2_CR20","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TPAMI.2008.34","volume":"31","author":"D. Zhao","year":"2009","unstructured":"Zhao, D., Yang, L.: Incremental isometric embedding of high-dimensional data using connected neighborhood graphs. IEEE TPAMI\u00a031(1), 86\u201398 (2009)","journal-title":"IEEE TPAMI"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:50:07Z","timestamp":1558291807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}