Sciweavers

177 search results - page 20 / 36
» Distributed Discovery of Large Near-Cliques
Sort
View
UAI
2008
14 years 11 months ago
Discovering Cyclic Causal Models by Independent Components Analysis
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
Gustavo Lacerda, Peter Spirtes, Joseph Ramsey, Pat...
GEOINFO
2007
14 years 11 months ago
Ecologically-aware Queries for Biodiversity Research
To carry ecologically-relevant biodiversity research, one must collect chunks of information on species and their habitats from a large number of institutions and correlate them us...
Luiz Celso Gomes Jr., Claudia Bauzer Medeiros
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 2 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
DEXA
2005
Springer
124views Database» more  DEXA 2005»
15 years 3 months ago
Scalable Distributed Aggregate Computations Through Collaboration
Computing aggregates over distributed data sets constitutes an interesting class of distributed queries. Recent advances in peer-to-peer discovery of data sources and query process...
Leonidas Galanis, David J. DeWitt
WWW
2009
ACM
15 years 10 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...