Sciweavers

691 search results - page 62 / 139
» Using Classifiers to Solve Warehouse Location Problems
Sort
View
IDEAL
2005
Springer
15 years 3 months ago
Cluster Analysis of High-Dimensional Data: A Case Study
Abstract. Normal mixture models are often used to cluster continuous data. However, conventional approaches for fitting these models will have problems in producing nonsingular es...
Richard Bean, Geoffrey J. McLachlan
ESANN
2008
14 years 11 months ago
K-nearest neighbours based on mutual information for incomplete data classification
Incomplete data is a common drawback that machine learning techniques need to deal with when solving real-life classification tasks. One of the most popular procedures for solving ...
Pedro J. García-Laencina, José-Luis ...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
15 years 10 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
15 years 10 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
IPL
2010
112views more  IPL 2010»
14 years 8 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...