Sciweavers

14850 search results - page 2645 / 2970
» A Geometric Approach to Betweenness
Sort
View
MOBIHOC
2009
ACM
16 years 7 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
KDD
2008
ACM
159views Data Mining» more  KDD 2008»
16 years 7 months ago
Semi-supervised learning with data calibration for long-term time series forecasting
Many time series prediction methods have focused on single step or short term prediction problems due to the inherent difficulty in controlling the propagation of errors from one ...
Haibin Cheng, Pang-Ning Tan
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 7 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
16 years 7 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 7 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
« Prev « First page 2645 / 2970 Last » Next »