Sciweavers

1310 search results - page 247 / 262
» Learning the k in k-means
Sort
View
CHI
2009
ACM
14 years 8 months ago
Designing for discovery: opening the hood for open-source end user tinkering
According to the Free Software Movement, the user ought to have "the freedoms to make changes, and to publish improved versions" and "to study how the program works...
Gifford Cheung, Parmit Chilana, Shaun K. Kane, Bra...
HPCA
2009
IEEE
14 years 8 months ago
Adaptive Spill-Receive for robust high-performance caching in CMPs
In a Chip Multi-Processor (CMP) with private caches, the last level cache is statically partitioned between all the cores. This prevents such CMPs from sharing cache capacity in r...
Moinuddin K. Qureshi
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
14 years 8 months ago
Network anomaly detection based on Eigen equation compression
This paper addresses the issue of unsupervised network anomaly detection. In recent years, networks have played more and more critical roles. Since their outages cause serious eco...
Shunsuke Hirose, Kenji Yamanishi, Takayuki Nakata,...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 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
2007
ACM
181views Data Mining» more  KDD 2007»
14 years 7 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain