Sciweavers

7648 search results - page 166 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
145
Voted
ADMA
2006
Springer
220views Data Mining» more  ADMA 2006»
15 years 8 months ago
Mining and Validation of Localized Frequent Web Access Patterns with Dynamic Tolerance
Mining user profiles is a crucial task for Web usage mining, and can be accomplished by mining frequent patterns. However, in the Web usage domain, sessions tend to be very sparse,...
Olfa Nasraoui, Suchandra Goswami
119
Voted
ICPR
2008
IEEE
15 years 9 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
227
Voted
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
15 years 7 months ago
A Method for Handling Numerical Attributes in GA-Based Inductive Concept Learners
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
Federico Divina, Maarten Keijzer, Elena Marchiori
NIPS
2008
15 years 4 months ago
Kernelized Sorting
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
Novi Quadrianto, Le Song, Alex J. Smola
147
Voted
IPSN
2009
Springer
15 years 9 months ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...