Sciweavers

2554 search results - page 409 / 511
» Keyword query cleaning
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 10 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
183
Voted
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 10 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
167
Voted
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 10 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
140
Voted
NPC
2004
Springer
15 years 10 months ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
SEM
2004
Springer
15 years 10 months ago
PlanetSim: A New Overlay Network Simulation Framework
Abstract. Current research in peer to peer systems is lacking appropriate environments for simulation and experimentation of large scale overlay services. This has led to a plethor...
Pedro García López, Carles Pairot, R...