Sciweavers

65 search results - page 5 / 13
» Selecting the right interestingness measure for association ...
Sort
View
POLICY
2005
Springer
14 years 14 days ago
Approximating Service Utility from Policies and Value Function Patterns
Service-oriented computing provides the right means for building flexible systems that allow dynamic configuration and on-the-fly composition. In order to realize this vision, ...
Steffen Lamparter, Daniel Oberle, Andreas Eberhart
PR
2006
80views more  PR 2006»
13 years 7 months ago
Neighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
PR
2006
111views more  PR 2006»
13 years 7 months ago
The Bhattacharyya space for feature selection and its application to texture segmentation
A feature selection methodology based on a novel Bhattacharyya space is presented and illustrated with a texture segmentation problem. The Bhattacharyya space is constructed from ...
Constantino Carlos Reyes-Aldasoro, Abhir Bhalerao
ALMOB
2007
74views more  ALMOB 2007»
13 years 7 months ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo
CN
2007
167views more  CN 2007»
13 years 7 months ago
Association management for data dissemination over wireless mesh networks
To enable multimedia broadcasting services in mesh networks, it is critical to optimize the broadcast traffic load. Traditionally, users associate with access points (APs) with th...
Dongwook Lee, Gayathri Chandrasekaran, Mukundan Sr...