Sciweavers

1403 search results - page 108 / 281
» Set cover algorithms for very large datasets
Sort
View
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
16 years 4 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
KDD
2008
ACM
135views Data Mining» more  KDD 2008»
16 years 4 months ago
Effective and efficient itemset pattern summarization: regression-based approaches
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
Ruoming Jin, Muad Abu-Ata, Yang Xiang, Ning Ruan
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 10 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
CN
2004
100views more  CN 2004»
15 years 4 months ago
Study of long-duration MPEG-trace segmentation methods for developing frame-size-based traffic models
Texture and temporal variations in scenes, and peculiarities of MPEG compression algorithms result in very complex frame-size data sets for any long-duration variable bit rate (VB...
Uttam K. Sarkar, Subramanian Ramakrishnan, Dilip S...
SIGCOMM
2010
ACM
15 years 4 months ago
Reducing energy consumption in IPTV networks by selective pre-joining of channels
IPTV services are the fastest growing television services in the world today. This is a bandwidth intensive service, requiring low latency and tight control of jitter. To guarante...
Fernando M. V. Ramos, Richard J. Gibbens, Fei Song...