Sciweavers

1314 search results - page 123 / 263
» Approximate data mining in very large relational data
Sort
View
VLDB
2005
ACM
180views Database» more  VLDB 2005»
15 years 7 months ago
Cache-conscious Frequent Pattern Mining on a Modern Processor
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
Amol Ghoting, Gregory Buehrer, Srinivasan Parthasa...
99
Voted
ICONIP
2009
14 years 11 months ago
Text Mining with an Augmented Version of the Bisecting K-Means Algorithm
There is an ever increasing number of electronic documents available today and the task of organizing and categorizing this ever growing corpus of electronic documents has become t...
Yutaro Hatagami, Toshihiko Matsuka
INFOCOM
2010
IEEE
14 years 11 months ago
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...
Peter Lieven, Björn Scheuermann
114
Voted
ICDM
2009
IEEE
92views Data Mining» more  ICDM 2009»
14 years 11 months ago
Semi-supervised Multi-task Learning with Task Regularizations
Multi-task learning refers to the learning problem of performing inference by jointly considering multiple related tasks. There have already been many research efforts on supervise...
Fei Wang, Xin Wang, Tao Li
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
15 years 8 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm