Sciweavers

205 search results - page 14 / 41
» Decision trees do not generalize to new variations
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 9 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
STACS
2001
Springer
14 years 1 months ago
Evasiveness of Subgraph Containment and Related Properties
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
Amit Chakrabarti, Subhash Khot, Yaoyun Shi
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
14 years 6 days ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
MMDB
2004
ACM
151views Multimedia» more  MMDB 2004»
14 years 2 months ago
Indexing of variable length multi-attribute motion data
Haptic data such as 3D motion capture data and sign language animation data are new forms of multimedia data. The motion data is multi-attribute, and indexing of multiattribute da...
Chuanjun Li, Gaurav N. Pradhan, Si-Qing Zheng, B. ...
ICLP
1992
Springer
14 years 21 days ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen