Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
We are creating an interactive tool to help non-professional web site builders create high quality designs. We have previously reported that quantitative measures of web page stru...
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
A one-day workshop on the topic of mining software repositories was held at ICSE 2005 in St. Louis, Missouri. Researchers and practitioners in this field try to transform static r...
During software development it is helpful to obtain early estimates of the defect density of software components. Such estimates identify fault-prone areas of code requiring furth...