Sciweavers

2382 search results - page 110 / 477
» Generating Seeded Trees from Data Sets
Sort
View
GRC
2005
IEEE
15 years 10 months ago
Discovering and ranking important rules
— Decision rules generated from reducts can fully describe a data set. We introduce a new method of evaluating rules by taking advantage of rough sets theory. We consider rules g...
Jiye Li, Nick Cercone
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 10 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
123
Voted
CIKM
2003
Springer
15 years 9 months ago
Hierarchical graph indexing
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
James Abello, Yannis Kotidis
VISUALIZATION
1998
IEEE
15 years 8 months ago
Isosurface extraction in time-varying fields using a temporal hierarchical index tree
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...
Han-Wei Shen
141
Voted
EWCBR
2006
Springer
15 years 8 months ago
Case-Based Reasoning for Knowledge-Intensive Template Selection During Text Generation
The present paper describes a case-based reasoning solution for solving the task of selecting adequate templates for realizing messages describing actions in a given domain. This s...
Raquel Hervás, Pablo Gervás