Sciweavers

249 search results - page 23 / 50
» Mining problem-solving strategies from HCI data
Sort
View
JSSPP
2005
Springer
14 years 3 months ago
AnthillSched: A Scheduling Strategy for Irregular and Iterative I/O-Intensive Parallel Jobs
Irregular and iterative I/O-intensive jobs need a different approach from parallel job schedulers. The focus in this case is not only the processing requirements anymore: memory, ...
Luís Fabrício Wanderley Góes,...
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
14 years 4 months ago
Metropolis Algorithms for Representative Subgraph Sampling
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
Christian Hübler, Hans-Peter Kriegel, Karsten...
DAWAK
2005
Springer
14 years 3 months ago
Automatic Selection of Bitmap Join Indexes in Data Warehouses
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
Kamel Aouiche, Jérôme Darmont, Omar B...
ICDE
2005
IEEE
176views Database» more  ICDE 2005»
14 years 3 months ago
LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern
Sequence pattern mining is an important research problem because it is the basis of many other applications. Yet how to efficiently implement the mining is difficult due to the ...
Zhenglu Yang, Masaru Kitsuregawa
IJCNN
2007
IEEE
14 years 4 months ago
An Associative Memory for Association Rule Mining
— Association Rule Mining is a thoroughly studied problem in Data Mining. Its solution has been aimed for by approaches based on different strategies involving, for instance, the...
Vicente O. Baez-Monroy, Simon O'Keefe