Sciweavers

12753 search results - page 2350 / 2551
» is 2002
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 4 months ago
Learning nonstationary models of normal network traffic for detecting novel attacks
Traditional intrusion detection systems (IDS) detect attacks by comparing current behavior to signatures of known attacks. One main drawback is the inability of detecting new atta...
Matthew V. Mahoney, Philip K. Chan
KDD
2002
ACM
175views Data Mining» more  KDD 2002»
16 years 4 months ago
Mining product reputations on the Web
Knowing the reputations of your own and/or competitors' products is important for marketing and customer relationship management. It is, however, very costly to collect and a...
Satoshi Morinaga, Kenji Yamanishi, Kenji Tateishi,...
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 4 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
16 years 4 months ago
Sequential cost-sensitive decision making with reinforcement learning
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
Edwin P. D. Pednault, Naoki Abe, Bianca Zadrozny
« Prev « First page 2350 / 2551 Last » Next »