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

Inchi Hu

dblp:33/5531 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2012
0000-0002-1582-5297ORCID · corroborated

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

Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Mathematical optimization · 67% Algorithms and data structures · 33%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
feature selection
0.112012
Interaction-based feature selection and classification for high-dimensional biological data · Bioinform. 2012
Bioinformatics and computational biology
gene expression analysis
0.112012
Interaction-based feature selection and classification for high-dimensional biological data · Bioinform. 2012
Bioinformatics and computational biology › statistical genetics
gene-gene interaction
0.112012
Interaction-based feature selection and classification for high-dimensional biological data · Bioinform. 2012
Bioinformatics and computational biology
cancer genomics
0.012012
Interaction-based feature selection and classification for high-dimensional biological data · Bioinform. 2012
Mathematical optimization › sequential decision making
optimal stopping
0.011993
On the minimum expected duration of a coin tossing game · IEEE Trans. Inf. Theory 1993
Algorithms and data structures
randomized algorithms
0.011993
On the minimum expected duration of a coin tossing game · IEEE Trans. Inf. Theory 1993
Mathematical optimization
restart strategies
0.011993
On the minimum expected duration of a coin tossing game · IEEE Trans. Inf. Theory 1993

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

interaction-based feature selection · 0.1classification · 0.1probabilistic analysis · 0.0dynamic programming · 0.0
YearPublicationVenuePosition
2012 Interaction-based feature selection and classification for high-dimensional biological data
abstract
MOTIVATION: Epistasis or gene-gene interaction has gained increasing attention in studies of complex diseases. Its presence as an ubiquitous component of genetic architecture of common human diseases has been contemplated. However, the detection of gene-gene interaction is difficult due to combinatorial explosion. RESULTS: We present a novel feature selection method incorporating variable interaction. Three gene expression datasets are analyzed to illustrate our method, although it can also be applied to other types of high-dimensional data. The quality of variables selected is evaluated in two ways: first by classification error rates, then by functional relevance assessed using biological knowledge. We show that the classification error rates can be significantly reduced by considering interactions. Secondly, a sizable portion of genes identified by our method for breast cancer metastasis overlaps with those reported in gene-to-system breast cancer (G2SBC) database as disease associated and some of them have interesting biological implication. In summary, interaction-based methods may lead to substantial gain in biological insights as well as more accurate prediction.
Maggie Haitian Wang, Shaw-Hwa Lo, Inchi Hu
Bioinform.4
1993 On the minimum expected duration of a coin tossing game
abstract
The following coin tossing game is analyzed: a store of N fair coins is given and it is desired to achieve M heads in a round of tosses of the coins. To allow for unfavorable sequences of tails, restarts are permitted at any epoch in the game where, in any restart, all coins are returned to store and tosses are begun anew from tabula rasa. A restart strategy is a prescription that specifies when a restart should be made. It is desired to estimate the minimum expected duration of the game over all restart strategies, and to find an optimal strategy that minimizes the expected duration of the game. This simple coin tossing game, proposed by R.L. Rivest, has cryptographic roots and is linked to issues in the factoring of integers.>
Inchi Hu, Santosh S. Venkatesh
IEEE Trans. Inf. Theory1