{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:31:55Z","timestamp":1725903115308},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319624150"},{"type":"electronic","value":"9783319624167"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62416-7_25","type":"book-chapter","created":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T11:02:38Z","timestamp":1498906958000},"page":"345-360","source":"Crossref","is-referenced-by-count":0,"title":["ivhd: A Robust Linear-Time and Memory Efficient Method for Visual Exploratory Data Analysis"],"prefix":"10.1007","author":[{"given":"Witold","family":"Dzwine","sequence":"first","affiliation":[]},{"given":"Rafa\u0142","family":"Wcis\u0142o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Tang, J., Liu, J., Zhang, M., Mei, Q.: Visualizing large-scale and high-dimensional data. In: Proceedings of the 25th International Conference on World Wide Web, pp. 287\u2013297 (2016)","DOI":"10.1145\/2872427.2883041"},{"key":"25_CR2","unstructured":"Johnson, W.P., Glenn, J.M.: Making Sense of Data I: A Practical Guide to Exploratory Data Analysis and Data Mining, 2nd edn. (2014)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Pawliczek, P., Dzwinel, W., Yuen, D.A.: Visual exploration of data by using multidimensional scaling on multi-core CPU, GPU and MPI cluster. Concurrency Comput. Pract. Experience 26(3), 662\u2013682 (2014)","DOI":"10.1002\/cpe.3027"},{"key":"25_CR4","unstructured":"van der Maaten, L., Postma, E.O., van den Herik, H.J.: Dimensionality reduction: a comparative review. J. Mach. Learn. Res. 10, 66\u201371 (2009)"},{"key":"25_CR5","unstructured":"Hinton, G.E., Roweis, S.T.: Stochastic neighbor embedding. In: Advances in Neural Information Processing Systems, pp. 833\u2013840 (2002)"},{"key":"25_CR6","unstructured":"van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 2579\u20132605 (2011)"},{"key":"25_CR7","unstructured":"van der Maaten, L.: Accelerating t-SNE using tree-based algorithms. J. Mach. Learn. Res. 15, 3221\u20133245 (2014)"},{"key":"25_CR8","unstructured":"Zhirong, Y., Peltonen, J., Kaski, S.: Optimization equivalence of divergences improves neighbor embedding. In: Proceedings of the 31st International Conference on Machine Learning, Beijing, China (2014)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Ingram, S., Munzner, T.: Dimensionality reduction for documents with nearest neighbor queries. Neurocomputing 150, 557\u2013569 (2015)","DOI":"10.1016\/j.neucom.2014.07.073"},{"key":"25_CR10","unstructured":"Pezzotti, N., H\u00f6llt, T., Lelieveldt, B., Eisemann,E., Vilanova, A.: Hierarchical stochastic neighbor embedding. Comput. Graph. Forum. 35(3), 21\u201330 (2016)"},{"key":"25_CR11","unstructured":"Hu, Y., Lei, S.: Visualizing large graphs. Wiley Interdisc. Rev. Comput. Stat. 7(2), 15\u2013136 (2015)"},{"key":"25_CR12","unstructured":"Dzwinel, W., Wcis\u0142o, R.: Very fast interactive visualization of large sets of high-dimensional data. Procedia Comput. Sci. 51, 572\u2013581 (2015)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Dzwinel, W., Wcis\u0142o, R., Czech, W.: ivga: a fast force-directed method for interactive visualization of complex networks. J. Comput. Sci. (2016). in print, available on-line","DOI":"10.1016\/j.jocs.2016.09.001"},{"key":"25_CR14","unstructured":"Borcea, C., Streinu, I.: The number of embeddings of minimally rigid graphs. Discrete Comput. Geom. 31(2), 287\u2013303 (2004)"},{"key":"25_CR15","unstructured":"Muja, M., David G.L.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36(11), 2227\u20132240 (2014)"},{"key":"25_CR16","unstructured":"Lee, K.M.: Locality-sensitive hashing techniques for nearest neighbor search. Int. J. Fuzzy Logic Intell. Syst. 12(4), 300\u2013307 (2012)"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Dzwinel, W., Wcis\u0142o, R., Matwin, S.: ivhd: a fast and simple algorithm for embedding large and high-dimensional data, working version available (2017). www.researchgate.net , doi: 10.13140\/RG.2.2.28959.15520\/1","DOI":"10.13140\/RG.2.2.28959.15520\/1"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: International Conference on Database Theory, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62416-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T00:46:24Z","timestamp":1569631584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62416-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319624150","9783319624167"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62416-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}