Sciweavers

62 search results - page 7 / 13
» Efficient Spectral Feature Selection with Minimum Redundancy
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
Feature selection for unsupervised discovery of statistical temporal structures in video
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...
Lexing Xie, Shih-Fu Chang, Ajay Divakaran, Huifang...
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
15 years 11 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
PAMI
2006
206views more  PAMI 2006»
14 years 9 months ago
MILES: Multiple-Instance Learning via Embedded Instance Selection
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called...
Yixin Chen, Jinbo Bi, James Ze Wang
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
15 years 10 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
JSAC
2008
97views more  JSAC 2008»
14 years 9 months ago
Spectrally-efficient relay selection with limited feedback
This paper addresses the multiplexing loss that occurs in relay networks due to causality of relays and the halfduplex constraint. We devise relay selection methods to recover the ...
Ramy Tannious, Aria Nosratinia