Abstract
The growing amount of various kinds of information triggers the need to develop efficient network computing systems, as single machines in many cases are not able to provide effective processing and analysis. One of the very promising approaches of distributed data analysis is combined classification, which could be relatively easily implemented in distributed computing systems. In this paper we address problem of decentralized distributed computing system for mentioned above classification method. We focus on the system fairness. The performance metric is defined as a maximum response time, i.e., the computing system should be designed to minimize the response time of each client using the system. We assume that the system is decentralized and each request is sent by the client directly to computing nodes without assistance of a central service. An ILP (Integer Linear Programming) model is formulated and applied to obtain optimal results provided by branch-and-cut algorithm included in the CPLEX solver. Widespread simulations are performed to evaluate properties of the computing system in terms of several parameters describing the system.
This is a preview of subscription content, log in via an institution to check access.
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
Anderson, D.: BOINC: A System for Public-Resource Computing and Storage. In: Proc. of the Fifth IEEE/ACM International Workshop on Grid Computing, pp. 4–10 (2004)
Buford, J., Yu, H., Lua, E.: P2P Networking and Applications. Morgan Kaufmann, San Francisco (2009)
Milojicic, D., et al.: Peer to Peer computing. HP Laboratories Palo Alto, Technical Report HPL-2002-57 (2002)
Nabrzyski, J., Schopf, J., Węglarz, J. (eds.): Grid resource management:state of the art and future trends. Kluwer Academic Publishers, Boston (2004)
Shen, X., Yu, H., Buford, J., Akon, M. (eds.): Handbook of Peer-to-Peer Networking. Springer, Heidelberg (2009)
Tarkoma, S.: Overlay Networks: Toward Information Networking. Auerbach Publications (2010)
Taylor, I.: From P2P to Web services and grids: peers in a client/server world. Springer, Heidelberg (2005)
Travostino, F., Mambretti, J., Karmous Edwards, G.: Grid Networks Enabling grids with advanced communication technology. Wiley, Chichester (2006)
Jain, A.K., Duin, P.W., Mao, J.: Statistical Pattern Recognition: A Review. IEEE Trans. on PAMI 22(1), 4–37 (2000)
Kuncheva, L.I.: Combining Pattern Classifiers: Methods and Algorithms. New Jersey (2004)
Miller, D.J., Zhang, Y., Kesidis, G.: Decision Aggregation in Distributed Classification by a Transductive Extension of Maximum Entropy/Improved Iterative Scaling, Hindawi Publishing Corporation. EURASIP Journal on Advances in Signal Processing Volume (2008)
Kacprzak, T., Walkowiak, K., Woźniak, M.: Optimization of Overlay Distributed Computing Systems for Multiple Classifier System – Heuristic Approach. Logic Journal of IGPL (in press, 2011)
Vaidya, J., Clifton, C.W., Zhu, Y.M.: Privacy Preserving Data Mining. Springer, New York (2006)
Aggrawal, C.C., Yu, P.S.: Privacy-Preserving Data Mining: Models and Algorithms. Springer, New York (2008)
Lindell, Y., Pinkas, B.: Secure Multiparty Computation for Privacy-Preserving Data Mining. The Journal of Privacy and Confidentiality 1(1), 59–98 (2009)
Kuncheva, L.I., Whitaker, C.J., Shipp, C.A., Duin, R.P.W.: Limits on the Majority Vote Accuracy in Classier Fusion. Pattern Analysis and Applications 6, 22–31 (2003)
Alexandre, L.A., Campilho, A.C., Kamel, M.: Combining Independent and Unbiased Classifiers Using Weighted Average. In: Proc. of the 15th ICPR, vol. 2, pp. 495–498 (2000)
Biggio, B., Fumera, G., Roli, F.: Bayesian Analysis of Linear Combiners. In: Haindl, M., Kittler, J., Roli, F. (eds.) MCS 2007. LNCS, vol. 4472, pp. 292–301. Springer, Heidelberg (2007)
Duin, R.P.W.: The Combining Classifier: to Train or Not to Train? In: Proc. of the ICPR 2002, Quebec City (2002)
Przewoźniczek, M., Walkowiak, K., Woźniak, M.: Optimizing distributed computing systems for k-nearest neighbors classifiers - evolutionary approach. Logic Journal of IGPL (2011), doi:10.1093/jigpal/jzq034
Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, San Francisco (2004)
Puchinger, J., Raidl, G., Pferschy, U.: The Multidimensional Knapsack Problem: Structure and Algorithms. Informs Journal on Computing (2009), doi:10.1287/ijoc.1090.0344
ILOG CPLEX, 12.0 User’s Manual, France (2007)
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
Walkowiak, K., Sztajer, S., Woźniak, M. (2011). Decentralized Distributed Computing System for Privacy-Preserving Combined Classifiers – Modeling and Optimization. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6782. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21928-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-21928-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21927-6
Online ISBN: 978-3-642-21928-3
eBook Packages: Computer ScienceComputer Science (R0)