Sciweavers

1601 search results - page 129 / 321
» Closed Sets for Labeled Data
Sort
View
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
16 years 6 months ago
A data mining approach to modeling relationships among categories in image collection
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
Ruofei Zhang, Zhongfei (Mark) Zhang, Sandeep Khanz...
TKDE
2008
153views more  TKDE 2008»
15 years 6 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
PAA
2002
15 years 6 months ago
Hierarchical Fusion of Multiple Classifiers for Hyperspectral Data Analysis
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
Shailesh Kumar, Joydeep Ghosh, Melba M. Crawford
ICIP
1998
IEEE
16 years 7 months ago
A Combinatorical Approach to Vector Tomography for Doppler Spectral Data
Velocity spectra of a flow can be made by ultrasound Doppler measurements. Using only part of the information in these spectra, it is possible to reconstruct the solenoid part and...
Kent Stråhlén
SSD
2005
Springer
173views Database» more  SSD 2005»
15 years 11 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras