Sciweavers

1083 search results - page 63 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
DKE
2006
110views more  DKE 2006»
15 years 6 months ago
Efficient mining of group patterns from user movement data
In this paper, we present a new approach to derive groupings of mobile users based on their movement data. We assume that the user movement data are collected by logging location ...
Yida Wang, Ee-Peng Lim, San-Yih Hwang
INFOCOM
2005
IEEE
15 years 11 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
EEF
2000
15 years 9 months ago
Distributed and Structured Analysis Approaches to Study Large and Complex Systems
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
Gianfranco Ciardo
ICPR
2004
IEEE
16 years 7 months ago
A Pattern Synthesis Technique with an Efficient Nearest Neighbor Classifier for Binary Pattern Recognition
Important factors affecting the efficiency and performance of the nearest neighbor classifier (NNC) are space, classification time requirements and for high dimensional data, due ...
M. Narasimha Murty, P. Viswanath, Shalabh Bhatnaga...
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
16 years 5 days ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...