Sciweavers

4085 search results - page 536 / 817
» Benchmarking Data Mining Algorithms
Sort
View
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 8 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
ICDM
2010
IEEE
105views Data Mining» more  ICDM 2010»
15 years 5 months ago
On the Vulnerability of Large Graphs
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
Hanghang Tong, B. Aditya Prakash, Charalampos E. T...
KDD
2006
ACM
141views Data Mining» more  KDD 2006»
16 years 7 months ago
Statistical entity-topic models
The primary purpose of news articles is to convey information about who, what, when and where. But learning and summarizing these relationships for collections of thousands to mil...
David Newman, Chaitanya Chemudugunta, Padhraic Smy...
KDD
2006
ACM
172views Data Mining» more  KDD 2006»
16 years 7 months ago
Attack detection in time series for recommender systems
Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recom...
Sheng Zhang, Amit Chakrabarti, James Ford, Fillia ...
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
16 years 7 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler