Sciweavers

1339 search results - page 77 / 268
» Robust learning from bites for data mining
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 6 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
VLDB
1998
ACM
147views Database» more  VLDB 1998»
14 years 1 months ago
Scalable Techniques for Mining Causal Structures
Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
Craig Silverstein, Sergey Brin, Rajeev Motwani, Je...
EDBTW
2010
Springer
13 years 6 months ago
A decision support system to improve e-learning environments
Nowadays, due to the lack of face-to-face contact, distance course instructors have real difficulties knowing who their students are, how their students behave in the virtual cour...
Marta E. Zorrilla, Diego García, Elena &Aac...
KDD
2004
ACM
330views Data Mining» more  KDD 2004»
14 years 9 months ago
Learning to detect malicious executables in the wild
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
Jeremy Z. Kolter, Marcus A. Maloof
JASIS
2000
143views more  JASIS 2000»
13 years 8 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng