Sciweavers

374 search results - page 55 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
NIPS
1994
14 years 11 months ago
On-line Learning of Dichotomies
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
N. Barkai, H. Sebastian Seung, Haim Sompolinsky
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
15 years 10 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
SIGKDD
2002
83views more  SIGKDD 2002»
14 years 9 months ago
Towards Effective and Interpretable Data Mining by Visual Interaction
The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...
Charu C. Aggarwal
GRAPHITE
2004
ACM
15 years 3 months ago
Dual space drawing methods for cones
Ruled surface design and its applications are widely used in CAGD (Computer Aid Geometric Design) and industrial areas. In this paper, the cone is a particular ruled surface, whic...
Rena Ding, Yan Zhang
AAAI
1994
14 years 11 months ago
Inductive Learning For Abductive Diagnosis
A new inductive learning system, Lab Learning for ABduction, is presented which acquires abductive rules from a set of training examples. The goal is to nd a small knowledge base ...
Cynthia A. Thompson, Raymond J. Mooney