Sciweavers

17688 search results - page 247 / 3538
» Data Set Balancing
Sort
View
CAINE
2009
15 years 4 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...
IPPS
2000
IEEE
15 years 11 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
An Algorithm to List All the Fixed-Point Free Involutions on a Finite Set
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
Cyril Prissette
GI
2010
Springer
15 years 5 months ago
Ranked Set Search in Medline Documents
: Information needs like searching scientific literature that involve high recall rates are difficult to satisfy with ad hoc keyword search. We propose to state queries implicitl...
Kristin Mittag, Alexander Hinneburg
CVPR
2007
IEEE
16 years 8 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...