Sciweavers

4039 search results - page 196 / 808
» A Method for Dynamic Clustering of Data
Sort
View
MLDM
2005
Springer
15 years 10 months ago
Linear Manifold Clustering
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
Robert M. Haralick, Rave Harpaz
ICDE
2007
IEEE
129views Database» more  ICDE 2007»
15 years 11 months ago
Ontology-driven Rule Generalization and Categorization for Market Data
—Radio Frequency Identification (RFID) is an emerging technique that can significantly enhance supply chain processes and deliver customer service improvements. RFID provides use...
Dongwoo Won, Dennis McLeod
92
Voted
KDD
1998
ACM
193views Data Mining» more  KDD 1998»
15 years 9 months ago
Methods for Linking and Mining Massive Heterogeneous Databases
Manyreal-world KDDexpeditions involve investigation of relationships betweenvariables in different, heterogeneousdatabases. Wepresent a dynamic programmingtechnique for linking re...
José C. Pinheiro, Don X. Sun
WIMOB
2008
IEEE
15 years 11 months ago
Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
Shouwen Lai, Binoy Ravindran, Hyeonjoong Cho
ICDM
2006
IEEE
148views Data Mining» more  ICDM 2006»
15 years 11 months ago
Data Mining Approaches to Criminal Career Analysis
— Narrative reports and criminal records are stored digitally across individual police departments, enabling the collection of this data to compile a nation-wide database of crim...
Jeroen S. de Bruin, Tim K. Cocx, Walter A. Kosters...