Sciweavers

2227 search results - page 307 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
131
Voted
CIKM
2009
Springer
15 years 10 months ago
Completing wikipedia's hyperlink structure through dimensionality reduction
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...
Robert West, Doina Precup, Joelle Pineau
IJON
2010
121views more  IJON 2010»
15 years 19 days ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen
MOBISYS
2004
ACM
16 years 3 months ago
Improving the Latency of 802.11 hand-offs using Neighbor Graphs
The 802.11 IEEE Standard has enabled low cost and effective wireless LAN services (WLAN). With the sales and deployment of WLAN based networks exploding, many people believe that ...
Minho Shin, Arunesh Mishra, William A. Arbaugh
132
Voted
CP
2007
Springer
15 years 7 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
SDM
2008
SIAM
129views Data Mining» more  SDM 2008»
15 years 4 months ago
Statistical Density Prediction in Traffic Networks
Recently, modern tracking methods started to allow capturing the position of massive numbers of moving objects. Given this information, it is possible to analyze and predict the t...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...