Sciweavers

804 search results - page 93 / 161
» Experiments on Union-Find Algorithms for the Disjoint-Set Da...
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 1 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
WWW
2009
ACM
14 years 8 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 5 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
DEEC
2006
IEEE
14 years 1 months ago
Maintaining Web Navigation Flows for Wrappers
A substantial subset of the web data follows some kind of underlying structure. In order to let software programs gain full benefit from these “semistructured” web sources, wra...
Juan Raposo, Manuel Álvarez, José Lo...
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
14 years 4 days ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang