Hong Liu

Hong Liu
Shandong University | SDU · Department of Computer Science and Technology

Ph.D

About

13
Publications
552
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
164
Citations
Citations since 2016
1 Research Item
58 Citations
2016201720182019202020212022024681012
2016201720182019202020212022024681012
2016201720182019202020212022024681012
2016201720182019202020212022024681012
Introduction
Computational Complexities, Algorithms for Winner Determination Problems, Manipulation Problems in Social Choice.
Skills and Expertise

Publications

Publications (13)
Article
A clause is not-all-equal satisfied if it has at least one literal assigned with true and one literal assigned with false. Max NAE-SAT is given by a boolean variable set U and a clause set C, asks to find an assignment of U, such that the number of not-all-equal satisfied clauses in C is maximized. Max NAE-SAT turns into Max NAE-k-SAT if each claus...
Article
Full-text available
Given a tree T = (V, E) with n vertices and a collection of terminal sets D = {S 1, S 2, …, S c }, where each S i is a subset of V and c is a constant, the generalized Multiway Cut in trees problem (GMWC(T)) asks to find a minimum size edge subset E′ ⊆ E such that its removal from the tree separates all terminals in S i from each other for each ter...
Article
Elections are an important preference aggregation model in a variety of areas. Given a pool of n potential voters, the chair may strategically selecting k voters from the pool to feed to an election system, in order to control the final outcome of the election system. This type of control, called control by voter selection, is closely related to tw...
Conference Paper
In this paper, we introduce and study three graph modification problems: 2-Club Cluster Vertex Deletion, 2-Club Cluster Edge Deletion, and 2-Club Cluster Editing. In 2-Club Cluster Vertex Deletion (2-Club Cluster Edge Deletion, and 2-Club Cluster Editing), one is given an undirected graph G and an integer k ≥ 0, and needs to decide whether it is po...
Article
Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election. We obtain the following results: constructive control by adding candidates is W[2]-hard with respect to the parameter “number of added candidates”; both constructive and destructive control...
Article
Inverse Scope Problem aims to determine, by analyzing the structure of a metabolic network, the minimum cardinality set of seed compounds required for the synthesis of a specific compound or set of compounds. This paper examines the computational complexity of three variants of the inverse scope problem from parameterized complexity view. With as n...
Article
Voting systems are common tools in a variety of areas. This paper studies parameterized computational complexity of control of Plurality, Condorcet and Approval voting systems, respectively. The types of controls considered include adding or deleting candidates or voters, under constructive or destructive setting. We obtain the following results: (...
Conference Paper
The concept of elementary (flux) modes provides a rigorous description of pathways in metabolic networks. Finding the elementary modes with minimum number of reactions (shortest elementary modes) is an interesting problem and has potential uses in various applications. However, this problem is NP-hard. This work is an initial step to analyze this p...
Conference Paper
A huge number of protein sequences have been generated and collected. However, the functions of most of them are still unknown. Protein subcellular localization is important to elucidate protein function. It would be worthwhile to develop a method to predict the subcellular location for a given protein when only the amino acid sequence of the prote...
Article
A method to assign fuzzy labels to unlabeled hypertext documents based on hyperlink structure information is first proposed. Then, the construction of the fuzzy transductive support vector machines is described. Also, an algorithm to train the fuzzy transductive support vector machines is presented. While in the transductive support vector machines...
Article
A genetic semi-supervised fuzzy clustering algorithm is proposed, which can learn text classifier from labeled and unlabeled documents.
Article
For learning classifier from labeled and unlabeled data, this paper proposes an evolutionary semi-supervised fuzzy clustering algorithm. Class labels information provided by labeled data is used to guide the evolution process of each fuzzy partition on unlabeled data, which plays the role of chromosome. The fitness of each chromosome is evaluated w...
Conference Paper
Full-text available
A genetic semi-supervised fuzzy clustering algorithm is pro- posed, which can learn text classifier from labeled and unlabeled docu- ments. Labeled documents are used to guide the evolution process of each chromosome, which is fuzzy partition on unlabeled documents. The fit- ness of each chromosome is evaluated with a combination of fuzzy within cl...

Network

Cited By

Projects

Project (1)