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

Li Wang 0007

dblp:58/6810-7 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorArtificial intelligence and machine learning · 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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › statistical estimation › regression › robust regression
least absolute deviations
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Mathematical optimization
parameter tuning
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Mathematical optimization › regularization
regularization path
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Mathematical optimization › statistical estimation › regression
regularized regression
0.112006
Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning · ICDM 2006
Information retrieval › retrieval models
ad-hoc retrieval
0.012004
Tuning before feedback: combining ranking discovery and blind feedback for robust retrieval · SIGIR 2004
Information retrieval › relevance feedback
pseudo-relevance feedback
0.012004
Tuning before feedback: combining ranking discovery and blind feedback for robust retrieval · SIGIR 2004
Information retrieval › query reformulation
query expansion
0.012004
Tuning before feedback: combining ranking discovery and blind feedback for robust retrieval · SIGIR 2004

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

lasso · 0.1l1-norm penalty · 0.1ranking discovery · 0.0
YearPublicationVenuePosition
2006 Regularized Least Absolute Deviations Regression and an Efficient Algorithm for Parameter Tuning
abstract
Linear regression is one of the most important and widely used techniques for data analysis. However, sometimes people are not satisfied with it because of the following two limitations: 1) its results are sensitive to outliers, so when the error terms are not normally distributed, especially when they have heavy-tailed distributions, linear regression often works badly; 2) its estimated coefficients tend to have high variance, although their bias is low. To reduce the influence of outliers, robust regression models were developed. Least absolute deviation (LAD) regression is one of them. LAD minimizes the mean absolute errors, instead of mean squared errors, so its results are more robust. To address the second limitation, shrinkage methods were proposed, which add a penalty on the size of the coefficients. The LASSO is one of these methods and it uses the L1-norm penalty, which not only reduces the prediction error and the variance of estimated coefficients, but also provides an automatic feature selection function. In this paper, we propose the regularized least absolute deviation (RLAD) regression model, which combines the nice features of the LAD and the LASSO together. The RLAD is a regularization method, whose objective function has the form of "loss + penalty." The "loss" is the sum of the absolute deviations and the "penalty" is the L1-norm of the coefficient vector. Furthermore, to facilitate parameter tuning, we develop an efficient algorithm which can solve the entire regularization path in one pass. Simulations with various settings are performed to demonstrate its performance. Finally, we apply the algorithm to solve the image reconstruction problem and find interesting results.
Li Wang 0007, Michael D. Gordon
ICDM1
2006 An Empirical Investigation of Innovation and Community Development through Information and Communication Technology
abstract
Recently, discussion has begun to consider serving the base of the economic pyramid for business and societal benefit. Suggestions for so doing have focused on business model innovation, improving internal capabilities, promoting stronger governance, and providing leapfrog technologies (such as ICT) to promote effective change. We consider the questions of what types of innovation are occurring when businesses and other organizations enter the base of the pyramid and what types of social, economic, and consumer benefits they bring to local communities. We base our findings on an analysis of more than 1,000 cases describing base of the pyramid activities
Michael D. Gordon, Vijay Dakshinamoorthy, Li Wang 0007, Allen Hammond
ICTD3
2004 Tuning before feedback: combining ranking discovery and blind feedback for robust retrieval
abstract
Both ranking functions and user queries are very important factors affecting a search engine's performance. Prior research has looked at how to improve ad-hoc retrieval performance for existing queries while tuning the ranking function, or modify and expand user queries using a fixed ranking scheme using blind feedback. However, almost no research has looked at how to combine ranking function tuning and blind feedback together to improve ad-hoc retrieval performance. In this paper, we look at the performance improvement for ad-hoc retrieval from a more integrated point of view by combining the merits of both techniques. In particular, we argue that the ranking function should be tuned first, using user-provided queries, before applying the blind feedback technique. The intuition is that highly-tuned ranking offers more high quality documents at the top of the hit list, thus offers a stronger baseline for blind feedback. We verify this integrated model in a large scale heterogeneous collection and the experimental results show that combining ranking function tuning and blind feedback can improve search performance by almost 30% over the baseline Okapi system.
Weiguo Fan, Ming Luo 0001, Li Wang 0007, Wensi Xi, Edward A. Fox
SIGIR3