
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Marco Muselli, Enrico Ferrari, "Coupling Logical Analysis of Data and Shadow Clustering for Partially Defined Positive Boolean Function Reconstruction," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 1, pp. 3750, January, 2011.  
BibTex  x  
@article{ 10.1109/TKDE.2009.206, author = {Marco Muselli and Enrico Ferrari}, title = {Coupling Logical Analysis of Data and Shadow Clustering for Partially Defined Positive Boolean Function Reconstruction}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, number = {1}, issn = {10414347}, year = {2011}, pages = {3750}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.206}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Coupling Logical Analysis of Data and Shadow Clustering for Partially Defined Positive Boolean Function Reconstruction IS  1 SN  10414347 SP37 EP50 EPD  3750 A1  Marco Muselli, A1  Enrico Ferrari, PY  2011 KW  Positive Boolean function KW  logic synthesis KW  Logical Analysis of Data KW  Shadow Clustering. VL  23 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] H.W. Gschwind and E.J. McCluskey, Design of Digital Computers. SpringerVerlag, 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. SangiovanniVincentelli, 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. 443458, 1974.
[5] H. Liu and R. Setiono, "Feature Selection via Discretization," IEEE Trans. Knowledge and Data Eng., vol. 9, no. 4, pp. 642645, July 1997.
[6] R. Kohavi and M. Sahami, "ErrorBased and EntropyBased Discretization of Continuous Features," Proc. Second Int'l Conf. Knowledge Discovery and Data Mining, pp. 114119, 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. 292306, 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. 1822, SpringerVerlag, 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. 513527, 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. 12581268, 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. 2330, SpringerVerlag, 2006.
[13] J. Astola, D. Akopian, O. Vainio, and S. Agaian, "New DigitSerial Implementation of Stack Filters," Discrete Applied Math., vol. 61, pp. 181197, 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. 898911, 1986.
[15] E. Zermelo, "Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels," Proc. Fifth Congress of Mathematicians, pp. 501504, 1912.
[16] N. Bshouty, "Exact Learning Boolean Functions via the Monotone Theory," Information and Computation, vol. 123, pp. 146153, 1995.
[17] A. Blum, C. Burch, and J. Langford, "On Learning Monotone Boolean Functions," Proc. 39th Ann. Symp. Foundations of Computer Science, pp. 408415, 1998.
[18] V.I. Torvik and E. Triantaphyllou, "Minimizing the Average Query Complexity of Learning Monotone Boolean Functions," INFORMS J. Computing, vol. 14, pp. 142172, 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. 363373, 1999.
[20] E. Boros, P.L. Hammer, T. Ibaraki, and K. Kawakami, "Polynomial Time Recognition of 2Monotonic Positive Boolean Functions Given by an Oracle," SIAM J. Computing, vol. 26, pp. 93109, 1997.
[21] E. Boros, T. Ibaraki, and K. Makino, "ErrorFree and Best Fit Extensions of Partially Defined Boolean Functions," Information and Computation, vol. 140, pp. 254283, 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. 211213, 2001.
[23] M. Fredman and L. Khachiyan, "On the Complexity of Dualization of Monotone Disjunctive Normal Forms," J. Algorithms, vol. 21, pp. 618628, 1996.
[24] B. Kovalerchuk, E. Triantaphyllou, A.S. Deshpande, and E. Vityaev, "Interactive Learning of Monotone Boolean Functions," Information Sciences, vol. 94, pp. 87118, 1996.
[25] S. Agaian, J. Astola, and K. Egiazarian, Binary Polynomial Transforms and Nonlinear Digital Filters. Marcel Dekker, 1995.