Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianhua Guo 0005

dblp:99/1305-5 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-0734-1452ORCID · verified

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › structure learning
bayesian network structure learning
0.112010
A note on minimal d-separation trees for structural learning · Artif. Intell. 2010
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › conditional independence
d-separation
0.112010
A note on minimal d-separation trees for structural learning · Artif. Intell. 2010
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.112010
A note on minimal d-separation trees for structural learning · Artif. Intell. 2010

Methods — techniques the papers use, named apart from their topics

graph theory · 0.1
YearPublicationVenuePosition
2017 Building trust networks in the absence of trust relations
abstract
User-specified trust relations are often very sparse and dynamic, making them difficult to accurately predict from online social media. In addition, trust relations are usually unavailable for most social media platforms. These issues pose a great challenge for predicting trust relations and further building trust networks. In this study, we investigate whether we can predict trust relations via a sparse learning model, and propose to build a trust network without trust relations using only pervasively available interaction data and homophily effect in an online world. In particular, we analyze the reliability of predicting trust relations by interaction behaviors, and provide a principled way to mathematically incorporate interaction behaviors and homophily effect in a novel framework, bTrust. Results of experiments on real-world datasets from Epinions and Ciao demonstrated the effectiveness of the proposed framework. Further experiments were conducted to understand the importance of interaction behaviors and homophily effect in building trust networks.
Xin Wang 0035, Ying Wang 0009, Jianhua Guo 0005
Frontiers Inf. Technol. Electron. Eng.3
2016 Sharp Bounds on Survivor Average Causal Effects When the Outcome Is Binary and Truncated by Death
abstract
In randomized trials with follow-up, outcomes may be undefined for individuals who die before the follow-up is complete. In such settings, Frangakis and Rubin [2002] proposed the “principal stratum effect” or “Survivor Average Causal Effect” (SACE), which is a fair treatment comparison in the subpopulation that would have survived under either treatment arm. Many of the existing results for estimating the SACE are difficult to carry out in practice. In this article, when the outcome is binary, we apply the symbolic Balke-Pearl linear programming method to derive simple formulas for the sharp bounds on the SACE under the monotonicity assumption commonly used by many researchers.
Na Shan, Ping-Feng Xu, Jianhua Guo 0005
ACM Trans. Intell. Syst. Technol.4
2015 Feature subset selection using naive Bayes for text classification
Guozhong Feng, Jianhua Guo 0005, Bing-Yi Jing, Tieli Sun
Pattern Recognit. Lett.2
2013 Large-scale multiple testing in genome-wide association studies via region-specific hidden Markov models
abstract
BACKGROUND: Identifying genetic variants associated with complex human diseases is a great challenge in genome-wide association studies (GWAS). Single nucleotide polymorphisms (SNPs) arising from genetic background are often dependent. The existing methods, i.e., local index of significance (LIS) and pooled local index of significance (PLIS), were both proposed for modeling SNP dependence and assumed that the whole chromosome follows a hidden Markov model (HMM). However, the fact that SNP data are often collected from separate heterogeneous regions of a single chromosome encourages different chromosomal regions to follow different HMMs. In this research, we developed a data-driven penalized criterion combined with a dynamic programming algorithm to find change points that divide the whole chromosome into more homogeneous regions. Furthermore, we extended PLIS to analyze the dependent tests obtained from multiple chromosomes with different regions for GWAS. RESULTS: The simulation results show that our new criterion can improve the performance of the model selection procedure and that our region-specific PLIS (RSPLIS) method is better than PLIS at detecting disease-associated SNPs when there are multiple change points along a chromosome. Our method has been used to analyze the Daly study, and compared with PLIS, RSPLIS yielded results that more accurately detected disease-associated SNPs. CONCLUSIONS: The genomic rankings based on our method differ from the rankings based on PLIS. Specifically, for the detection of genetic variants with weak effect sizes, the RSPLIS method was able to rank them more efficiently and with greater power.
Wensheng Zhu, Jianhua Guo 0005
BMC Bioinform.3
2012 A Bayesian feature selection paradigm for text classification
Guozhong Feng, Jianhua Guo 0005, Bing-Yi Jing, Lizhu Hao
Inf. Process. Manag.2
2010 A note on minimal d-separation trees for structural learning
Binghui Liu, Jianhua Guo 0005, Bing-Yi Jing
Artif. Intell.2