Avraham A. Melkman

Publication Activity (10 Years)

Years Active: 1978-2023
Publications (10 Years): 9

Top Topics

Trained Neural Networks

Top Venues

IEEE Trans. Neural Networks Learn. Syst.

Int. J. Found. Comput. Sci.

Publications

Tatsuya Akutsu, Avraham A. Melkman, Atsuhiro Takasu
On the Trade-off between the Number of Nodes and the Number of Trees in a Random Forest. CoRR (2023)
Avraham A. Melkman, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu
On the Compressive Power of Boolean Threshold Autoencoders. IEEE Trans. Neural Networks Learn. Syst. 34 (2) (2023)
Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov
Shortest Longest-Path Graph Orientations. COCOON (1) (2023)
Tatsuya Akutsu, Avraham A. Melkman
On the Size and Width of the Decoder of a Boolean Threshold Autoencoder. CoRR (2021)
Avraham A. Melkman, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu
On the Compressive Power of Boolean Threshold Autoencoders. CoRR (2020)
Pengyu Liu, Avraham A. Melkman, Tatsuya Akutsu
Extracting boolean and probabilistic rules from trained neural networks. Neural Networks 126 (2020)
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. Int. J. Found. Comput. Sci. 31 (2) (2020)
Tatsuya Akutsu, Avraham A. Melkman
Identification of the Structure of a Probabilistic Boolean Network From Samples Including Frequencies of Outcomes. IEEE Trans. Neural Networks Learn. Syst. 30 (8) (2019)
Avraham A. Melkman, Xiaoqing Cheng, Wai-Ki Ching, Tatsuya Akutsu
Identifying a Probabilistic Boolean Threshold Network From Samples. IEEE Trans. Neural Networks Learn. Syst. 29 (4) (2018)
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu
On the complexity of finding a largest common subtree of bounded degree. Theor. Comput. Sci. 590 (2015)
Avraham A. Melkman, Tatsuya Akutsu
An Improved Satisfiability Algorithm for Nested Canalyzing Functions and its Application to Determining a Singleton Attractor of a Boolean Network. J. Comput. Biol. 20 (12) (2013)
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu
On the Complexity of Finding a Largest Common Subtree of Bounded Degree. FCT (2013)
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura
Singleton and 2-periodic attractors of sign-definite Boolean networks. Inf. Process. Lett. 112 (1-2) (2012)
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura
Finding a Periodic Attractor of a Boolean Network. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (5) (2012)
Dikla Dotan-Cohen, Dana Moonshine, Moshe Natan, Yonat Shemer-Avni, Avraham A. Melkman
GO for Integration of Expression Data. Silico Biol. 11 (1-2) (2012)
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions. J. Comput. Biol. 18 (10) (2011)
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu
) time. Inf. Process. Lett. 110 (14-15) (2010)
Dikla Dotan-Cohen, Simon Kasif, Avraham A. Melkman
Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering. Bioinform. 25 (14) (2009)
Dikla Dotan-Cohen, Avraham A. Melkman, Simon Kasif
Hierarchical tree snipping: clustering guided by prior knowledge. Bioinform. 23 (24) (2007)
Qiaofeng Yang, Stefano Lonardi, Avraham A. Melkman
A Compression-Boosting Transform for Two-Dimensional Data. AAIM (2006)
Avraham A. Melkman, Eran Shaham
Sleeved coclustering. KDD (2004)
Shlomi Dolev, Boris Fitingof, Avraham A. Melkman, Olga Tubman
Smooth and adaptive forward erasure correcting. Comput. Networks 36 (2/3) (2001)
Avraham A. Melkman, Solomon Eyal Shimony
A Note on Approximate Inclusion-exclusion. Discret. Appl. Math. 73 (1) (1997)
Avraham A. Melkman, Solomon Eyal Shimony
Algorithms for Parsimonious Complete Sets in Directed Graphs. Inf. Process. Lett. 59 (6) (1996)
David Leiser, Yoella Bereby, Avraham A. Melkman
A comparison of display methods for spatial point layout. Behav. Inf. Technol. 14 (3) (1995)
Avraham A. Melkman
On-Line Construction of the Convex Hull of a Simple Polyline. Inf. Process. Lett. 25 (1) (1987)
Ian F. Blake, Avraham A. Melkman
On an inverse for sections of a binomial matrix. Discret. Math. 23 (2) (1978)