Liang Zhao 0013

dblp:63/5422-13 · DBLP profile ↗
← Back
18ranked-venue papers
7as first author
8since 2021 · last 2024
0000-0003-0869-7896ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 6 first-authorApplied, interdisciplinary, general and emerging computing · 7 · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1
YearPublicationVenuePosition
2024 Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference
abstract
In this paper, we propose a novel family of descriptors of chemical graphs, named cycle-configuration (CC), that can be used in the standard "two-layered (2L) model" of mol-infer, a molecular inference framework based on mixed integer linear programming (MILP) and machine learning (ML). Proposed descriptors capture the notion of ortho/meta/para patterns that appear in aromatic rings, which has been impossible in the framework so far. Computational experiments show that, when the new descriptors are supplied, we can construct prediction functions of similar or better performance for all of the 27 tested chemical properties. We also provide an MILP formulation that asks for a chemical graph with desired properties under the 2L model with CC descriptors (2L+CC model). We show that a chemical graph with up to 50 non-hydrogen vertices can be inferred in a practical time.
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao 0013, Tatsuya Akutsu
BIBM5
2024 A Method for Inferring Polymers Based on Linear Regression and Integer Programming
abstract
A novel framework has recently been proposed for designing the molecular structure of chemical compounds with a desired chemical property using both artificial neural networks and mixed integer linear programming. In this paper, we design a new method for inferring a polymer based on the framework. For this, we introduce a new way of representing a polymer as a form of monomer and define new descriptors that feature the structure of polymers. We also use linear regression as a building block of constructing a prediction function in the framework. The results of our computational experiments reveal a set of chemical properties on polymers to which a prediction function constructed with linear regression performs well. We also observe that the proposed method can infer polymers with up to 50 non-hydrogen atoms in a monomer form.
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu
IEEE ACM Trans. Comput. Biol. Bioinform.6
2024 Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes
abstract
A novel framework for designing the molecular structure of chemical compounds with a desired chemical property has recently been proposed. The framework infers a desired chemical graph by solving a mixed integer linear program (MILP) that simulates the computation process of two functions: a feature function defined by a two-layered model on chemical graphs and a prediction function constructed by a machine learning method. To improve the learning performance of prediction functions in the framework, we design a method that splits a given data set$\mathcal {C}$into two subsets$\mathcal {C}^{(i)},i=1,2$by a hyperplane in a chemical space so that most compounds in the first (resp., second) subset have observed values lower (resp., higher) than a threshold$\theta$. We construct a prediction function$\psi$to the data set$\mathcal {C}$by combining prediction functions$\psi _{i},i=1,2$each of which is constructed on$\mathcal {C}^{(i)}$independently. The results of our computational experiments suggest that the proposed method improved the learning performance for several chemical properties to which a good prediction function has been difficult to construct.
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu
IEEE ACM Trans. Comput. Biol. Bioinform.4
2023 Attentive Cross-Domain Few-shot Learning and Domain Adaptation in HSI Classification
abstract
This study explores the application of Attentive Cross-Domain Few-Shot Learning (ACDFSL) in Hyperspectral Image (HSI) Classification, specifically addressing challenges associated with environments possessing limited labeled data. Our approach applies the Squeeze-and-Excitation (SE) attention and Residual elements within a deep learning architecture of four convolution blocks. This innovative strategy of integrating attention mechanisms into few-shot learning models represents a significant departure from traditional practices. After rigorous assessment, the ACDFSL model showcased outstanding results, revealing performance rates of 92.14%, 96.23%, and 91.27% in OA, AA, and Kappa, respectively, on the Salinas dataset. Additionally, the model attained rates of 85.67%, 89.66%, and 85.4% on the University of Pavia (PU) dataset. These results indicate an edge over existing state-of-the-art techniques such as SVM, 3D-CNN, SSRN, and other DFSL variants. This considerable progress emphasizes the potential and applicability of the ACDFSL approach in real-world HSI Classification scenarios, especially where labeled data is sparse, and paves the way for future research in this sphere.
Rojan Basnet, Rimsa Goperma, Liang Zhao 0013
TENCON3
2022 A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming
abstract
Drug discovery is one of the major goals of computational biology and bioinformatics. A novel framework has recently been proposed for the design of chemical graphs using both artificial neural networks (ANNs) and mixed integer linear programming (MILP). This method consists of a prediction phase and an inverse prediction phase. In the first phase, an ANN is trained using data on existing chemical compounds. In the second phase, given a target chemical property, a feature vector is inferred by solving an MILP formulated from the trained ANN and then a set of chemical structures is enumerated by a graph enumeration algorithm. Although exact solutions are guaranteed by this framework, the types of chemical graphs have been restricted to such classes as trees, monocyclic graphs, and graphs with a specified polymer topology with cycle index up to 2. To overcome the limitation on the topological structure, we propose a new flexible modeling method to the framework so that we can specify a topological substructure of graphs and a partial assignment of chemical elements and bond-multiplicity to a target graph. The results of computational experiments suggest that the proposed system can infer chemical graphs with around up to 50 non-hydrogen atoms.
Jianshen Zhu, Naveed Ahmed Azam, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu
IEEE ACM Trans. Comput. Biol. Bioinform.6
2021 Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search
abstract
A novel framework has recently been proposed for designing the molecular structure of chemical compounds with a desired chemical property using both artificial neural networks and mixed integer linear programming. In the framework, a chemical graph with a target chemical value is inferred as a feasible solution of a mixed integer linear program that represents a prediction function and other requirements on the structure of graphs. In this paper, we propose a procedure for generating other feasible solutions of the mixed integer linear program by searching the neighbor of output chemical graph in a search space. The procedure is combined in the framework as a new building block. The results of our computational experiments suggest that the proposed method can generate an additional number of new chemical graphs with up to 50 non-hydrogen atoms.
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu
BIBM4
2021 An Inverse QSAR Method Based on Decision Tree and Integer Programming
Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu
ICIC (2)5
2021 An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu
IEA/AIE (1)4
2017 Genesis: New Media Art Created as a Visualization of Fluid Dynamics
Naoko Tosa, Yunian Pang, Liang Zhao 0013, Ryohei Nakatsu
ICEC3
2013 A Practical Approach for Finding Small {Independent, Distance} Dominating Sets in Large-Scale Graphs
Liang Zhao 0013, Hiroshi Kadowaki, Dorothea Wagner
ICA3PP (2)1
2007 An Efficient Algorithm for Generating Colored Outerplanar Graphs
Jiexun Wang, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu
TAMC2
2006 Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao 0013
Discret. Appl. Math.4
2004 On generalized greedy splitting algorithms for multiway partition problems
Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki
Discret. Appl. Math.1
2003 A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki
Discret. Appl. Math.1
2003 A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem
Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki
Inf. Process. Lett.1
2001 A Unified Framework for Approximating Multiway Partition Problems
Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki
ISAAC1
2001 A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph
Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki
STACS1
1999 Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
Liang Zhao 0013, Hiroshi Nagamochi, Toshihide Ibaraki
ISAAC1