Sciweavers

387 search results - page 25 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 2 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 8 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
GECCO
2007
Springer
197views Optimization» more  GECCO 2007»
14 years 1 months ago
Computational intelligence techniques: a study of scleroderma skin disease
This paper presents an analysis of microarray gene expression data from patients with and without scleroderma skin disease using computational intelligence and visual data mining ...
Julio J. Valdés, Alan J. Barton
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
DMIN
2006
144views Data Mining» more  DMIN 2006»
13 years 9 months ago
Discovering Assignment Rules in Workforce Schedules Using Data Mining
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
Jihong Yan