Sciweavers

17688 search results - page 226 / 3538
» Data Set Balancing
Sort
View
SDM
2004
SIAM
224views Data Mining» more  SDM 2004»
15 years 7 months ago
Hierarchical Clustering for Thematic Browsing and Summarization of Large Sets of Association Rules
In this paper we propose a method for grouping and summarizing large sets of association rules according to the items contained in each rule. We use hierarchical clustering to par...
Alípio Jorge
ANOR
2006
174views more  ANOR 2006»
15 years 6 months ago
Evaluation of choice set generation algorithms for route choice models
This paper discusses choice set generation and route choice model estimation for large-scale urban networks. Evaluating the effectiveness of Advanced Traveler Information Systems (...
Shlomo Bekhor, Moshe E. Ben-Akiva, M. Scott Rammin...
JMLR
2002
89views more  JMLR 2002»
15 years 6 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
ADAC
2010
124views more  ADAC 2010»
15 years 6 months ago
Comparing partitions of two sets of units based on the same variables
Abstract We propose a procedure based on a latent variable model for the comparison of two partitions of different units described by the same set of variables. The null hypothesis...
Genane Youness, Gilbert Saporta
JMLR
2011
133views more  JMLR 2011»
15 years 1 months ago
Operator Norm Convergence of Spectral Clustering on Level Sets
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
Bruno Pelletier, Pierre Pudlo