Abstract
A basic problem in data science is to classify a massive data set into different categories. In addition, when more new data samples are collected or come from online sources, we want to know how to put the new data sample into an appropriate category. This problem contains such information as classification, learning, and reconstruction. As we discussed in Chap. 2, the problem is central to several disciplinary areas including artificial intelligence, pattern recognition, and statistics. It is obvious that this is still a main problem in data science but the size of the data set has been changed to “BigData” and the ultimate goal of the process has become online based in many cases.
In this chapter, we introduce a comprehensive method for this complex problem. This method provides a unified framework for concurrent data science to solve the related problem. The method begins by considering data relations and connectivity among data points or data groups. These relations and connectivity are mostly incomplete. Then, we build a model to analyze, classify, or reconstruct the data or data sets, which is called the λ-connectedness method.
The method is built on general graphs. It also has some relations to persistent analysis that will be discussed in Chap. 6 Persistent analysis tries to find topological structures in cloud data. Combining λ-connectedness with persistent analysis can result in the classification of data sets into geometrically meaningful components, such as desired shapes or having characteristics of tracking and recognition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
B. Basavaprasad, R.S. Hegadi, A survey on traditional and graph theoretical techniques for image segmentation. Int. J. Comput. Appl. (Recent Adv. Inform. Technol.) 1, 38–46 (2014)
G. Carlsson, Topology and data. Bull. (New Ser.) Am. Math. Soc. 46(2), 255–308 (2009). doi:10.1090/s0273-0979-09-01249-x
L. Chen, The necessary and sufficient condition and the efficient algorithms for gradually varied fill. Chin. Sci. Bull. 35, 10 (1990). Abstracts of SIAM Conference on Geometric Design, Temple, AZ, 1989
L. Chen, The lambda-connected segmentation and the optimal algorithm for split-and-merge segmentation. Chin. J. Comput. 14, 321–331 (1991)
L. Chen, Gradually varied surface and its optimal uniform approximation (IS&T/SPIE Symposium on Electronic Imaging). SPIE Proc. 2182, 300–307 (1994)
L. Chen, λ-connectedness and its application to image segmentation, recognition, and reconstruction. Ph.D. thesis, University of Luton, 2001
L. Chen, λ-connected approximations for rough sets, in Lecture Notes in Computer Science, vol. 2457 (Springer, Berlin, 2002), pp. 572–577
L. Chen, Discrete Surfaces and Manifolds: A Theory of Digital-Discrete Geometry and Topology (SP Computing, Rockville, 2004)
L. Chen, λ-measure for bone density connectivity, in Proceedings of IEEE International Symposium on Industrial Electronics Montreal, QC, pp. 489–494, 2006
L. Chen, Digital Functions and Data Reconstruction (Springer, Berlin, 2013)
L. Chen, O. Adjei, λ-connected segmentation and fitting: three new algorithms, in Proceedings of IEEE conference on System, Man, and Cybernetics, 2004
L. Chen, H.D. Cheng, J. Zhang, Fuzzy subfiber and its application to seismic lithology classification. Inform. Sci. Appl. 1(2), 77–95 (1994)
L. Chen, D.H. Cooley, L. Zhang, An Intelligent data fitting technique for 3D velocity reconstruction. Appl. Sci. Comput. Intell. Proc. SPIE 3390, 103–112 (1998)
L. Chen, O. Adjei, D.H. Cooley, λ-connectedness: method and application, in Proceedings of IEEE conference on System, Man, and Cybernetics 2000, pp. 1157–1562, 2000
T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, 1993)
W. Elhefnawy, L. Chen, Y. Li, Improving normalize-cut image segmentation using λ-connectedness, in Presented in the meeting of The Extreme Science and Engineering Discovery Environment (XSEDE), St. Louis, 2015
P. Ghosh, F.T. Berkey, Autonomous identification and classification of ionospheric sporadic E in digital ionograms. Earth Space Sci 2(7), 244–261 (2015)
R.C. Gonzalez, R. Wood, Digital Image Processing (Addison-Wesley, Reading, MA, 1993)
S.L. Horowitz, T. Pavlidis, Picture segmentation by a tree traversal algorithm. J. ACM 23, 368–388 (1976)
F. Jiang, M.R. Frater, M. Pickering, Threshold-based image segmentation through an improved particle swarm optimisation, in Proceedings of International Conference on Digital Image Computing Techniques and Applications (DICTA), pp. 1–5, 2012
R. Klette, A Concise Computer Vision (Springer, Berlin, 2012)
D. Lazarevi, M. Misic, B. Cirkovi, Image segmentation as a classification task in computer applications, in 8th International Quality Conference, 2014
S. Lefschetz, Introduction to Topology (Princeton University Press, Princeton, 1949)
C.L. Liu, Elements of Discrete Mathematics (McGraw Hill, New York, 1985)
C.-T. Lu, Y. Kou, J. Zhao, L. Chen, Detecting and tracking region outliers in meteorological data. Inform. Sci. 177, 1609–1632 (2007)
A. Mouton, On artefact reduction, segmentation and classification of 3D computed tomography imagery in baggage security screening. Ph.D. thesis, University of Cranfield, 2014
D. Mumford, J. Shah, Optimal approximation by piecewise smooth functions and associated variational problems. Commun. Pure Appl. Math. 42, 577–685 (1989)
N. Pal, S. Pal, A review on image segmentation techniques. Pattern Recogn. 26, 1277–1294 (1993)
T. Pavilidis, Algorithms for Graphics and Image Processing (Computer Science Press, Rockville, MD, 1982)
J.-C. Pinoli, Mathematical Foundations of Image Processing and Analysis, vols. 1 and 2 (Wiley, New York, 2014)
W.H. Press et al., Numerical Recipes in C: The Art of Scientific Computing, 2nd edn. (Cambridge University Press, Cambridge, 1993)
X. Ren, J. Malik, Learning a classification model for segmentation, in Proceedings of IEEE International Conference on Computer Vision, pp. 10–17, 2003
A. Rosenfeld, “Continuous” functions on digital pictures. Pattern Recogn. Lett. 4, 177–184 (1986)
A. Rosenfeld, A.C. Kak, Digital Picture Processing, 2nd edn. (Academic, New York, 1982)
S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, 3rd edn. (Pearson, Boston, 2009)
H. Samet, The Design and Analysis of Spatial Data Structures (Addison Wesley, Reading, MA, 1990)
L.K. Saul, S.T. Roweis, Think globally, fit locally: unsupervised learning of low dimensional manifolds. J. Mach. Learn. Res. 4, 119–155 (2003)
A. Sengur, I. Turkoglu, M.C. Ince, A comparative study on entropic thresholding methods. Istanbul Univ. J. Electr. Electron. Eng. 6(2), 183–188 (2006)
J. Shi, J. Malik, Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
M. Spann, R. Wilson, A quad-tree approach to image segmentation which combines statistical and spatial information. Pattern Recogn. 18, 257–269 (1985)
A. Teran, Real-time multi-target tracking: a study on color-texture covariance matrices and descriptor/operator switching. Ph.D. thesis, University of Paris Sud Paris XI, 2013
S. Theodoridis, K. Koutroumbas, Pattern Recognition (Academic, Orlando, FL, 2003)
L.C. Tsai, F.T. Berkey, Ionogram analysis using fuzzy segmentation and connectedness techniques. Radio Sci. 35, 1173–1186 (2000)
M.Y. Wang, J.S. Ping, Martian ionogram scaling by the object tracking method. Sci. China Phys. Mech. Astron. 55(3), 540–545 (2012)
M. Yamanaka, M. Matsugu, Information processing apparatus, control method for information processing apparatus and storage medium. US 8792725 B2, Canon Kabushiki Kaisha. http://www.google.com.ar/patents/US8792725
C.T. Zahn, Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comput. 20(1), 68–86 (1971)
A.J. Zomorodian, Topology for Computing. Cambridge Monographs on Applied and Computational Mathematics (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Chen, L.M. (2015). Relationship and Connectivity of Incomplete Data Collection. In: Mathematical Problems in Data Science. Springer, Cham. https://doi.org/10.1007/978-3-319-25127-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-25127-1_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25125-7
Online ISBN: 978-3-319-25127-1
eBook Packages: Computer ScienceComputer Science (R0)