output
20072025
most citedFeature selection with test cost constraint

170 citations

Showing 2013Show all

11 papers · 1 filter

math.ST2013

The consistency of estimator under fixed design regression model with NQD errors

Jian-hua Shi, Xiao-ping Chen, Yong Zhou

In this article, basing on NQD samples, we investigate the fixed design nonparametric regression model, where the errors are pairwise NQD random errors, with fixed design points, a…

cs.AI2013

Connectedness of graphs and its application to connected matroids through covering-based rough sets

Aiping Huang, William Zhu

Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a wi…

cs.AI2013★ 1 cited

Dependence space of matroids and its application to attribute reduction

Aiping Huang, William Zhu

Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have…

cs.AI2013

Connectivity for matroids based on rough sets

Bin Yang, William Zhu

In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect…

cs.AI2013

Applications of repeat degree on coverings of neighborhoods

Hua Yao, William Zhu

In covering based rough sets, the neighborhood of an element is the intersection of all the covering blocks containing the element. All the neighborhoods form a new covering called…

cs.IR2013★ 1 cited

Mining top-k granular association rules for recommendation

Fan Min, William Zhu

Recommender systems are important for e-commerce companies as well as researchers. Recently, granular association rules have been proposed for cold-start recommendation. However, e…