The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2011 vol.23)
pp: 37-50
Marco Muselli , Italian National Research Council, Genoa
The problem of reconstructing the and-or expression of a partially defined positive Boolean function (pdpBf) is solved by adopting a novel algorithm, denoted by LSC, which combines the advantages of two efficient techniques, Logical Analysis of Data (LAD) and Shadow Clustering (SC). The kernel of the approach followed by LAD consists in a breadth-first enumeration of all the prime implicants whose degree is not greater than a fixed maximum d. In contrast, SC adopts an effective heuristic procedure for retrieving the most promising logical products to be included in the resulting and-or expression. Since the computational cost required by LAD prevents its application even for relatively small dimensions of the input domain, LSC employs a depth-first approach, with asymptotically linear memory occupation, to analyze the prime implicants having degree not greater than d. In addition, the theoretical analysis proves that LSC presents almost the same asymptotic time complexity as LAD. Extensive simulations on artificial benchmarks validate the good behavior of the computational cost exhibited by LSC, in agreement with the theoretical analysis. Furthermore, the pdpBf retrieved by LSC always shows a better performance, in terms of complexity and accuracy, with respect to those obtained by LAD.
Positive Boolean function, logic synthesis, Logical Analysis of Data, Shadow Clustering.
Marco Muselli, "Coupling Logical Analysis of Data and Shadow Clustering for Partially Defined Positive Boolean Function Reconstruction", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 1, pp. 37-50, January 2011, doi:10.1109/TKDE.2009.206
[1] H.W. Gschwind and E.J. McCluskey, Design of Digital Computers. Springer-Verlag, 1975.
[2] T. Downs and M.F. Schultz, Logic Design with Pascal. Van Nostrand Reinhold, 1988.
[3] R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, 1984.
[4] S.J. Hong, R.G. Cain, and D.L. Ostapko, "MINI: A Heuristic Approach for Logic Minimization," IBM J. Research and Development, vol. 18, pp. 443-458, 1974.
[5] H. Liu and R. Setiono, "Feature Selection via Discretization," IEEE Trans. Knowledge and Data Eng., vol. 9, no. 4, pp. 642-645, July 1997.
[6] R. Kohavi and M. Sahami, "Error-Based and Entropy-Based Discretization of Continuous Features," Proc. Second Int'l Conf. Knowledge Discovery and Data Mining, pp. 114-119, 1996.
[7] E. Boros, P.L. Hammer, T. Ibaraki, A. Kogan, E. Mayoraz, and I. Muchnik, "An Implementation of Logical Analysis of Data," IEEE Trans. Knowledge and Data Eng., vol. 12, no. 2, pp. 292-306, Mar./Apr. 2000.
[8] M. Muselli, "Approximation Properties of Positive Boolean Functions," WIRN/NAIS 2005, Lecture Notes in Computer Science, B. Apolloni, M. Marinaro, G. Nicosia, and R. Tagliaferri, eds., vol. 3931, pp. 18-22, Springer-Verlag, 2006.
[9] M. Muselli and D. Liberati, "Training Digital Circuits with Hamming Clustering," IEEE Trans. Circuit and Systems—I: Fundamental Theory and Applications, vol. 47, no. 4, pp. 513-527, Apr. 2000.
[10] M. Muselli and D. Liberati, "Binary Rule Generation via Hamming Clustering," IEEE Trans. Knowledge and Data Eng., vol. 14, no. 6, pp. 1258-1268, Nov. 2002.
[11] M. Muselli and A. Quarati, "Reconstructing Positive Boolean Functions with Shadow Clustering," Proc. 17th European Conf. Circuit Theory and Design (ECCTD '05), 2005.
[12] M. Muselli, "Switching Neural Networks: A New Connectionist Model for Classification," WIRN/NAIS 2005, Lecture Notes in Computer Science, B. Apolloni, M. Marinaro, G. Nicosia, and R. Tagliaferri, eds., vol. 3931, pp. 23-30, Springer-Verlag, 2006.
[13] J. Astola, D. Akopian, O. Vainio, and S. Agaian, "New Digit-Serial Implementation of Stack Filters," Discrete Applied Math., vol. 61, pp. 181-197, Aug. 1997.
[14] P.D. Wendt, E.J. Coyle, and N.C. Gallagher, "Stack Filters," IEEE Trans. Acoustic, Speech and Signal Processing, vol. 34, pp. 898-911, 1986.
[15] E. Zermelo, "Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels," Proc. Fifth Congress of Mathematicians, pp. 501-504, 1912.
[16] N. Bshouty, "Exact Learning Boolean Functions via the Monotone Theory," Information and Computation, vol. 123, pp. 146-153, 1995.
[17] A. Blum, C. Burch, and J. Langford, "On Learning Monotone Boolean Functions," Proc. 39th Ann. Symp. Foundations of Computer Science, pp. 408-415, 1998.
[18] V.I. Torvik and E. Triantaphyllou, "Minimizing the Average Query Complexity of Learning Monotone Boolean Functions," INFORMS J. Computing, vol. 14, pp. 142-172, 2002.
[19] V. Gurvich and L. Khachiyan, "On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions," Discrete Applied Math., vols. 96/97, pp. 363-373, 1999.
[20] E. Boros, P.L. Hammer, T. Ibaraki, and K. Kawakami, "Polynomial Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle," SIAM J. Computing, vol. 26, pp. 93-109, 1997.
[21] E. Boros, T. Ibaraki, and K. Makino, "Error-Free and Best Fit Extensions of Partially Defined Boolean Functions," Information and Computation, vol. 140, pp. 254-283, 1998.
[22] I. Shmulevich, A. Korshunov, and J. Astola, "Almost All Monotone Boolean Functions Are Polynomially Learnable Using Membership Queries," Information Processing Letters, vol. 79, pp. 211-213, 2001.
[23] M. Fredman and L. Khachiyan, "On the Complexity of Dualization of Monotone Disjunctive Normal Forms," J. Algorithms, vol. 21, pp. 618-628, 1996.
[24] B. Kovalerchuk, E. Triantaphyllou, A.S. Deshpande, and E. Vityaev, "Interactive Learning of Monotone Boolean Functions," Information Sciences, vol. 94, pp. 87-118, 1996.
[25] S. Agaian, J. Astola, and K. Egiazarian, Binary Polynomial Transforms and Nonlinear Digital Filters. Marcel Dekker, 1995.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool