Sciweavers

612 search results - page 10 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 3 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
ISSTA
2009
ACM
15 years 4 months ago
Advanced code coverage analysis using substring holes
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...
Yoram Adler, Eitan Farchi, Moshe Klausner, Dan Pel...
PAMI
2007
166views more  PAMI 2007»
14 years 9 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
92
Voted
ICSE
2008
IEEE-ACM
15 years 11 months ago
Data flow testing of service-oriented workflow applications
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
Lijun Mei, W. K. Chan, T. H. Tse
IPPS
2006
IEEE
15 years 4 months ago
Neighbourhood maps: decentralised ranking in small-world P2P networks
Reputation in P2P networks is an important tool to encourage cooperation among peers. It is based on ranking of peers according to their past behaviour. In large-scale real world ...
Matteo Dell'Amico