Sciweavers

11231 search results - page 1662 / 2247
» Digging for Data Structures
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
16 years 15 days 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
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
16 years 14 days ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
SEMWEB
2004
Springer
16 years 14 days ago
GridVine: Building Internet-Scale Semantic Overlay Networks
Abstract. This paper addresses the problem of building scalable semantic overlay networks. Our approach follows the principle of data independence by separating a logical layer, th...
Karl Aberer, Philippe Cudré-Mauroux, Manfre...
WAIM
2004
Springer
16 years 14 days ago
Mining Web Sequential Patterns Incrementally with Revised PLWAP Tree
Since point and click at web pages generate continuous data stream, which flow into web log data, old patterns may be stale and need to be updated. Algorithms for mining web seque...
Christie I. Ezeife, Min Chen
WAIM
2004
Springer
16 years 14 days ago
Estimating the Selectivity of XML Path Expression with Predicates by Histograms
Selectivity estimation of path expressions in querying XML data plays an important role in query optimization. A path expression may contain multiple branches with predicates, each...
Yu Wang, Haixun Wang, Xiaofeng Meng, Shan Wang
« Prev « First page 1662 / 2247 Last » Next »