Sciweavers

10289 search results - page 1864 / 2058
» Standard bases in K
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 7 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 7 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
182views Data Mining» more  KDD 2002»
16 years 7 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...
CHI
2008
ACM
16 years 7 months ago
The LilyPad Arduino: using computational textiles to investigate engagement, aesthetics, and diversity in computer science educa
The advent of novel materials (such as conductive fibers) combined with accessible embedded computing platforms have made it possible to re-imagine the landscapes of fabric and el...
Leah Buechley, Michael Eisenberg, Jaime Catchen, A...
« Prev « First page 1864 / 2058 Last » Next »