Sciweavers

2180 search results - page 28 / 436
» Algorithms for discovering bucket orders from data
Sort
View
ADC
2005
Springer
183views Database» more  ADC 2005»
14 years 2 months ago
Discovering User Access Pattern Based on Probabilistic Latent Factor Model
There has been an increased demand for characterizing user access patterns using web mining techniques since the informative knowledge extracted from web server log files can not ...
Guandong Xu, Yanchun Zhang, Jiangang Ma, Xiaofang ...
INAP
2001
Springer
14 years 27 days ago
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
Dennis P. Groth, Edward L. Robertson
PTS
2010
175views Hardware» more  PTS 2010»
13 years 6 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
APVIS
2007
13 years 10 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
PAKDD
2005
ACM
161views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Online Algorithms for Mining Inter-stream Associations from Large Sensor Networks
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
K. K. Loo, Ivy Tong, Ben Kao