{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:49:18Z","timestamp":1761947358995},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540370253"},{"type":"electronic","value":"9783540370260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11811305_60","type":"book-chapter","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T13:30:33Z","timestamp":1153920633000},"page":"542-549","source":"Crossref","is-referenced-by-count":7,"title":["The Practical Method of Fractal Dimensionality Reduction Based on Z-Ordering Technique"],"prefix":"10.1007","author":[{"given":"Guanghui","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanhuai","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","first-page":"1","volume-title":"Proc of the 6th Int\u2019l Conf on Information and Knowledge Management","author":"R. Baeza-Yates","year":"1997","unstructured":"Baeza-Yates, R., Navarro, G.: Block-addressing indices for approximate text retrieval. In: Golshani, F., Makki, K. (eds.) Proc of the 6th Int\u2019l Conf on Information and Knowledge Management, pp. 1\u20138. ACM Press, New York (1997)"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-57301-1_5","volume-title":"Proc. of the 4th Int\u2019l Conf Foundations of Data Organization and Algorithms","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases1. In: Lomet, D.B. (ed.) Proc. of the 4th Int\u2019l Conf Foundations of Data Organization and Algorithms, pp. 69\u201384. Springer, Berlin (1993)"},{"issue":"11","key":"60_CR3","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1109\/TKDE.2004.68","volume":"16","author":"D. Jiang","year":"2004","unstructured":"Jiang, D., Tang, C., Zhang, A.: Cluster Analysis for Gene Expression Data: A Survey. IEEE Transactions on Knowledge and Data Engineering\u00a016(11), 1370\u20131386 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"60_CR4","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1126\/science.270.5235.467","volume":"270","author":"M.D. Schena","year":"1995","unstructured":"Schena, M.D., Shalon, R., Davis, R., Brown, P.: Quantitative Monitoring of Gene Expression Patterns with a Compolementatry DNA Microarray. Science\u00a0270, 467\u2013470 (1995)","journal-title":"Science"},{"key":"60_CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874668","volume-title":"Adaptive Control Process: A Guide Tour","author":"R. Bellman","year":"1961","unstructured":"Bellman, R.: Adaptive Control Process: A Guide Tour. Princeton University Press, Princeton, New Jersey (1961)"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Vafaie, H., Jong, K.A.D.: Robust Feature Selection Algorithms. In: Intl. Conf. on Tools with AI, Boston, MA, pp. 356\u2013363 (1993)","DOI":"10.1109\/TAI.1993.633981"},{"key":"60_CR7","first-page":"199","volume-title":"Artificial Intelligence and Statistics V","author":"D.W. Aha","year":"1996","unstructured":"Aha, D.W., Bankert, R.L.: A Comparative Evaluation of Sequential Feature Selection Algorithms. In: Artificial Intelligence and Statistics V, pp. 199\u2013206. Springer, New York (1996)"},{"key":"60_CR8","unstructured":"Scherf, M., Brauer, W.: Feature Selection by Means of a Feature Weighting Approach. Technical Report FKI-221-97, Technische Universit\u00e4t M\u00fcnchen, Munich (1997)"},{"key":"60_CR9","first-page":"245","volume":"97","author":"A. Blum","year":"1997","unstructured":"Blum, A., Langley, P.: Selection of Relevant Features and Examples in Machine Learning. AI\u00a097, 245\u2013271 (1997)","journal-title":"AI"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"2945","DOI":"10.1016\/S0031-3203(03)00176-6","volume":"36","author":"C. Francesco","year":"2003","unstructured":"Francesco, C.: Data dimensionality estimation methods: a survey. Pattern Recognition\u00a036, 2945\u20132954 (2003)","journal-title":"Pattern Recognition"},{"key":"60_CR11","volume-title":"Computational learning theory and natural learning systems","author":"P. Langley","year":"1997","unstructured":"Langley, P., Sage, S.: Scaling to Domains with many Irrelevant Features. In: Greiner, R. (ed.) Computational learning theory and natural learning systems, vol.\u00a04, MIT Press, Cambridge, MA (1997)"},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Seeger, B., Traina, A.J.M., Traina Jr., C.: Patial Join Selectivity Using Power Laws. In: ACM SIGMOD, Dallas, TX, pp. 177\u2013188 (2000)","DOI":"10.1145\/335191.335412"},{"key":"60_CR13","unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: An Improved R-tree using Fractals. In: 20th VLDB, Chile, pp. 500\u2013509 (1994)"},{"key":"60_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/nem.512","volume":"14","author":"D. Chakraborty","year":"2004","unstructured":"Chakraborty, D., Ashir, A., Suganuma, T., Mansfield Keeni, G., Roy, T.K., Shiratori, N.: Self-similar and fractal nature of Internet traffic. International Journal of Network Management\u00a014, 119\u2013129 (2004)","journal-title":"International Journal of Network Management"},{"key":"60_CR15","unstructured":"Traina Jr., C., Traina, A., et al.: Fast feature selection using fractal dimension. In: XV Brazilian DB Symposium, Jo\u00e3o Pessoa-PA-Brazil, pp. 158\u2013171 (2000)"},{"key":"60_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-540-27772-9_82","volume-title":"Advances in Web-Age Information Management","author":"Y. Bao","year":"2004","unstructured":"Bao, Y., Yu, G., Sun, H., Wang, D.: Performance Optimization of Fractal Dimension Based Feature Selection Algorithm. In: Li, Q., Wang, G., Feng, L. (eds.) WAIM 2004. LNCS, vol.\u00a03129, pp. 739\u2013744. Springer, Heidelberg (2004)"},{"issue":"8","key":"60_CR17","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/0375-9601(89)90854-2","volume":"141A","author":"L. Liebovitch","year":"1989","unstructured":"Liebovitch, L., Toth, T.: A Fast Algorithm to Determine Fractal Dimensions by Box Counting [J]. Physics Letters\u00a0141A(8), 386\u2013390 (1989)","journal-title":"Physics Letters"},{"key":"60_CR18","doi-asserted-by":"crossref","unstructured":"Orenstein, J., Merrett, T.H.: A class of data structures for associative searching. In: Proceedings of the Third ACM SIGACT- SIGMOD Symposium on Principles of Database Systems, pp. 181\u2013190 (1984)","DOI":"10.1145\/588011.588037"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11811305_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:11:30Z","timestamp":1555747890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11811305_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540370253","9783540370260"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11811305_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}