Sciweavers

654 search results - page 85 / 131
» Ordered Sets and Complete Lattices
Sort
View
NPL
2008
100views more  NPL 2008»
13 years 7 months ago
Comparing Combination Rules of Pairwise Neural Networks Classifiers
A decomposition approach to multiclass classification problems consists in decomposing a multiclass problem into a set of binary ones. Decomposition splits the complete multiclass ...
Olivier Lezoray, Hubert Cardot
GLOBECOM
2010
IEEE
13 years 5 months ago
Providing Secrecy Irrespective of Eavesdropper's Channel State
A usual concern against physical layer security is that the legitimate parties would need to have (partial) channel state information (CSI) of the eavesdropper in order to design t...
Xiang He, Aylin Yener
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
KAIS
2008
114views more  KAIS 2008»
13 years 7 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
13 years 5 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo