Sciweavers

8614 search results - page 1688 / 1723
» Mining
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 8 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 8 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
CSDA
2008
128views more  CSDA 2008»
13 years 8 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
DATAMINE
2008
137views more  DATAMINE 2008»
13 years 8 months ago
Two heads better than one: pattern discovery in time-evolving multi-aspect data
Abstract. Data stream values are often associated with multiple aspects. For example, each value observed at a given time-stamp from environmental sensors may have an associated ty...
Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke,...
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 8 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
« Prev « First page 1688 / 1723 Last » Next »