Sciweavers

1661 search results - page 218 / 333
» Decision Tree Fields
Sort
View
ICALP
2001
Springer
15 years 11 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot
IUI
2000
ACM
15 years 10 months ago
Adaptation in automated user-interface design
Design problems involve issues of stylistic preference and flexible standards of success; human designers often proceed by intuition and are unaware of following any strict rule-b...
Jacob Eisenstein, Angel R. Puerta
ACSAC
1999
IEEE
15 years 10 months ago
An Application of Machine Learning to Network Intrusion Detection
Differentiating anomalous network activity from normal network traffic is difficult and tedious. A human analyst must search through vast amounts of data to find anomalous sequenc...
Chris Sinclair, Lyn Pierce, Sara Matzner
DMKD
1999
ACM
108views Data Mining» more  DMKD 1999»
15 years 10 months ago
Classification as Mining and Use of Labeled Itemsets
We investigate the relationship between association and classification mining. The main issue in association mining is the discovery of interesting patterns of the data, so called...
Dimitris Meretakis, Beat Wüthrich
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
15 years 10 months ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz