Abstract
Each year, millions of people suffer from after-effects of pipeline leakages, spills, and eruptions. Leakages Detection Systems (LDS) are often used to understand and analyse these phenomena but unfortunately could not offer complete solution to reducing the scale of the problem. One recent approach was to collect datasets from these pipeline sensors and analyse offline, the approach yielded questionable results due to vast nature of the datasets. These datasets together with the necessity for powerful exploration tools made most pipelines operating companies “data rich but information poor”. Researchers have therefore identified problem of dimensional reduction for pipeline sensor datasets as a major research issue. Hence, systematic gap filling data mining development approaches are required to transform data “tombs” into “golden nuggets” of knowledge. This paper proposes an algorithm for this purpose based on the Incremental Orthogonal Centroid (IOC). Search time for specific data patterns may be enhanced using this algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goodyer, C., Hodrien, J., Jason, W., Brodlie, K.: Using high resolution display for high resolution 3d cardiac data. The Powerwall, pp. 5–16. University of Leeds (2009); The Powerwall Built from standard PC components of 7computers
Ebert, D.S., Rohrer, R.M., Shaw, C.D., Panda, P., Kukla, J.M., Roberts, D.A.: Procedural shape generation for multi-dimensional data visualisation. Computers and Graphics 24, 375–384 (2000)
Masashi, S.: Dimensionality reduction of multimodal labeled data by local Fisher Discriminant analysis. Journal of Machine Learning Research 8, 1027–1061 (2007)
Donoho, D.L.: High-dimensional data analysis. The curses and blessings of dimensionality. In: Lecture delivered at the Mathematical Challenges of the 21st Century Conference, August 6-11. The American Math. Society, Los Angeles (2000)
Yan, J., Benyu, Z., Ning, L., Shuicheng, Y., Qiansheng, C., Weiguo, F., Qiang, Y., Xi, W., Zheng, C.: Effective and Efficient Dimensionality Reduction for Large-Scale and Streaming Data Preprocessing. IEEE Transactions on Knowledge And Data Engineering 18(3), 320–333 (2006)
da Silva-Claudionor, R., Jorge, A., Silva, C., Selma, R.A.: Reduction of the dimensionality of hyperspectral data for the classification of agricultural scenes. In: 13th Symposium on Deformation Measurements and Analysis, and 14th IAG Symposium on Geodesy for Geotechnical and Structural Engineering, LNEC Libson May, 2008LBEC, LIBSON, May 12-15, pp. 1–10 (2008)
Giraldo, L., Felipe, L.F., Quijano, N.: Foraging theory for dimensionality reduction of clustered data. Machine Learning 82, 71–90 (2011), doi:10.1007/s10994-009-5156-0
Vaccaro, R.J.: SVD and Signal Processing II: Algorithms, Analysis andApplications. Elsevier Science (1991)
Artae, M., Jogan, M., Leonardis, A.: Incremental PCA for OnLine Visual Learning and Recognition. In: Proceedings of the 16th International Conference on Pattern Recognition, pp. 781–784 (2002)
Weng, J., Zhang, Y., Hwang, W.S.: Candid Covariance Free Incremental Principal Component Analysis. IEEE Transaction on Pattern Analysis and Machine Intelligence 25, 1034–1040 (2003)
Hiraoka, K., Hidai, K., Hamahira, M., Mizoguchi, H., Mishima, T., Yoshizawa, S.: Successive Learning of Linear Discriminant Analysis: Sanger-Type Algorithm. In: Proceedings of the 14th International Conference on Pattern Recognition, pp. 2664–2667 (2004)
Jeon, M., Park, H., Rosen, J.B.: Dimension Reduction Based on Centroids and Least Squares for Efficient Processing of Text Data. Technical Report MN TR 01-010, Univ. of Minnesota, Minneapolis (February 2001)
Park, H., Jeon, M., Rosen, J.: Lower Dimensional Representationof Text Data Based on Centroids and Least Squares. BIT Numerical Math. 43, 427–448 (2003)
Howland, P., Park, H.: Generalizing Discriminant Analysis Using the Generalized Singular Value Decomposition. IEEE Trans. Pattern Analysis and Machine Intelligence 26, 995–1006 (2004)
Han, J., Kamber, M.: Data Mining, Concepts and Techniques. Morgan Kaufmann (2001)
Mardia, K.V., Kent, J.T., Bibby, J.M.: Multivariate Analysis. Probability and Mathematical Statistics. Academic Press (1995)
Friedrnan, J.H., Tibshiirani, R.: Elements of Statistical Learning: Prediction. Inference and Data Mining. Springer, Heidelberg (2001)
Boulesteeix, A.: PLS Dimension reduction for classification with microarray data. Statistical Applications in Genetics and Molecular Biology 3(1), Article 33, 1–30 (2004)
Hand, D.J.: Discrimination and Classification. John Wiley, New York (1981)
Quinlan, J.R.: Induction of decision trees. Machine Learning 1, 81–106 (1986)
Quinlan, J.R.: Programs for Machine Learning. Morgan Kaufman (1993)
Cox, T.F., Cox, M.A.A.: Multidimensional Scaling, 2nd edn. Chapman and Hall (2001)
Hoppe, H.: New quadric metric for simplifiying meshes with appearance attributes. In: Proceedings IEEE Visualisation 1999. IEEE Computer Society Press (1999)
Hyvärinen, A.: Survey on independent component analysis. Neural Computing Surveys 2, 94–128 (1999)
Levoy, M.P.K., Curless, B., Rusinkiewicz, S., Koller, D., Pereira, L., Ginzton, M., Anderson, S., Davis, J., Ginsberg, J., Shade, J., Fulk, D.: The Digital Michelangelo Project. 3D scanning of large statues. In: Proceedings of ACM SIGGRAPH 2000. Computer Graphics Proceedings, Annual Conference Series, pp. 131–144. ACM (2000)
Lee, T.W.: Independent Component Analysis: Theory and Applications. Kluwer Academic Publishers (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Folorunso Olufemi, A., Sunar, M.S., Jusoh, N.M. (2011). Improved Incremental Orthogonal Centroid Algorithm for Visualising Pipeline Sensor Datasets. In: Badioze Zaman, H., et al. Visual Informatics: Sustaining Research and Innovations. IVIC 2011. Lecture Notes in Computer Science, vol 7066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25191-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-25191-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25190-0
Online ISBN: 978-3-642-25191-7
eBook Packages: Computer ScienceComputer Science (R0)