編集履歴一覧
編集履歴(バックアップ)のあるページ一覧
-
2.5K-Graphs: from Sampling to Generation
-
4chan and /b/: An Analysis of Anonymity and Ephemerality in a Large Online ...
-
A Data-Based Approach to Social Influence Maximization
-
A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence ...
-
A Fast and Provable Method for Estimating Clique Counts Using Turan's Theorem
-
A Gang of Bandits
-
A General Framework of Hybrid Graph Sampling for Complex Network Analysis
-
A practical bounding algorithm for computing two-terminal reliability based ...
-
A Submodular Framework for Graph Comparison
-
Accelerated k-means with adaptive distance bounds
-
Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest
-
Adaptation and Optimization of Biological Transport Networks
-
Analyzing Spammer's Social Networks for Fun and Profit
-
Approximate Bayesian Image Interpretation using Generative Probabilistic ...
-
Approximate Distance Oracle with Constant Query Time
-
Approximating the Spectrum of a Graph
-
Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications ...
-
Assessing Attack Vulnerability in Networks with Uncertainty
-
Balanced Graph Edge Partition
-
betweenness centrality
-
Chromatic Correlation Clustering
-
closeness centrality
-
cluster coefficient
-
Co-clustering documents and words using Bipartite Spectral Graph Partitioning
-
Computational Evolutionary Dynamics
-
Computing and maximizing influence in linear threshold and triggering models
-
Computing global structural balance in large-scale signed social networks
-
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
-
Correlation Clustering in MapReduce
-
Cost-aware Targeted Viral Marketing in Billion-scale Networks
-
Cost-effective Outbreak Detection in Networks
-
Crowdsourcing Algorithms for Entity Resolution
-
DAG Reduction: Fast Answering Reachability Queries
-
Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study
-
degree centrality
-
Delineating Social Network Data Anonymization via Random Edge Perturbation
-
Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with ...
-
DeViSE: A Deep Visual-Semantic Embedding Model
-
Discovering Frequent Subgraphs over Uncertain Graph Databases under ...
-
Discovering Highly Reliable Subgraphs in Uncertain Graphs
-
Distance Constraint Reachability Computation in Uncertain Graphs
-
Diversified Social Influence Maximization
-
Dynamic Density Based Clustering
-
Dynamic Influence Maximization Under Increasing Returns to Scale
-
Dynamic PageRank using Evolving Teleportation
-
Dynamic social networks promote cooperation in experiments with humans
-
Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive ...
-
Efficient Discovery of Frequent Subgraph Patterns in Uncertain Graph Databases
-
Efficient Influence Maximization in Social Networks
-
Efficient influence spread estimation for influence maximization under the ...
-
Efficient Personalized PageRank with Accuracy Assurance
-
Efficient Subgraph Search over Large Uncertain Graphs
-
Efficiently Anonymizing Social Networks with Reachability Preservation
-
Efficiently Computing k-Edge Connected Components via Graph Decomposition
-
eigenvector centrality
-
Estimating Clustering Coefficients and Size of Social Networks via Random Walk
-
Estimating Sizes of Social Networks via Biased Sampling
-
Exact Computation of Influence Spread by Binary Decision Diagrams
-
Exacting Social Events for Tweets Using a Factor Graph
-
Extrapolation Methods for Accelerating PageRank Computations
-
Fast Algorithm for the Lasso based L1-Graph Construction
-
Fast and Accurate k-means For Large Datasets
-
Fast and Provably Good Seedings for k-Means
-
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
-
Fast Approximation Algorithms for the Diameter and Radius of Sparse Graphs
-
Fast Discovery of Reliable Subnetworks
-
Fast Influence-based Coarsening for Large Networks
-
Fast Reliability Search in Uncertain Graphs
-
Fast Single-Pair SimRank Computation
-
FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs
-
Faster Random Walks By Rewiring Online Social Networks On-The-Fly
-
Finding Top-k Maximal Cliques in an Uncertain Graph
-
First Passage Time for Random Walks in Heterogeneous Networks
-
Frequent Subgraph Pattern Mining on Uncertain Graph Data
-
From Dango to Japanese Cakes: Query Reformulation Models and Patterns
-
Gelling, and Melting, Large Graphs by Edge Manipulation
-
Graph Theory Chapter 2
-
Graph Theory Chapter 2 Matching Covering and Packing
-
Hartigan's method
-
Hartigan's Method: k-means Clustering without Voronoi
-
Heat Kernel Based Community Detection
-
Holistic Influence Maximization: Combining Scalability and Efficiency with ...
-
How to Partition a Billion-Node Graph
-
IMRank: Influence Maximization via Finding Self-Consistent Ranking
-
Inferring Networks of Diffusion and Influence
-
Influence at Scale: Distributed Computation of Complex Contagion in Networks
-
Influence Blocking Maximization in Social Networks under the Competitive ...
-
Influence Maximization in Big Networks: An Incremental Algorithm for ...
-
Influence Maximization in Dynamic Social Networks
-
Influence Maximization in Near-Linear Time: A Martingale Approach
-
Influence Maximization with Viral Product Design
-
Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency
-
influence maximizationについて
-
Influence of the Dynamic Social Network Timeframe Type and Size on the Group ...
-
Information Diffusion and External Influence in Networks
-
Inverse Density as an Inverse Problem: The Fredholm Equation Approach
-
IRIE: Scalable and Robust Influence Maximization in Social Networks
-
iRoad: A Framework For Scalable Predictive Query Processing On Road Networks
-
k-core
-
k-means++
-
k-meansについて
-
k-Nearest Neighbors in Uncertain Graphs
-
k-plex
-
k-truss
-
Keyword-aware Optimal Route Search
-
Latent Feature Independent Cascade Model for Social Propagation
-
Learning Continuous-Time Information Diffusion Model for Social Behavioral ...
-
Learning with Local and Global Consistency
-
Limiting the Spread of Misinformation in Social Networks
-
Lloyd's method
-
Make It or Break It: Manipulating Robustness in Large Networks
-
Making k-means even faster
-
Marginalized Kernels Between Labeled Graphs
-
Massive Graph Triangulation
-
Maximising the Quality of Influence
-
Maximizing Influence in an Ising Network: A Mean-Field Optimal Solution
-
Maximizing Social Influence in Nearly Optimal Time
-
Maximizing Submodular Set Function with Connectivity Constraint: Theory and ...
-
Maximizing the Extent of Spread in a Dynamic Network
-
Maximizing the Spread of Cascades Using Network Design
-
Memory Efficient Minimum Substring Partitioning
-
Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a ...
-
Minimum Bisection is Fixed Parameter Tractable
-
Minimum Spanning Trees in Temporal Graphs
-
Minimum-Risk Maximum Clique Problem
-
More Effective Distributed ML via a Stale Synchronous Parallel Parameter Server
-
More is Simpler: Effectively and Efficiently Assessing Node Pair ...
-
n-clique
-
Negative Influence Minimizing by Blocking Nodes in Social Networks
-
On Bisubmodular Maximization
-
On k-Path Covers and their Applications
-
On k-skip Shortest Paths
-
On minimizing budget and time in influence propagation over social networks
-
On the Streaming Complexity of Computing Local Clustering Coefficients
-
On Triangulation-based Dense Neighborhood Graph Discovery
-
One-shot learning by inverting a compositional causal process
-
Online Influence Maximization
-
Online Search of Overlapping Communities
-
Optimizing Budget Allocation Among Channels and Influencers
-
OSNAP: Faster numerical linear algebra algorithms via sparser subspace ...
-
Outlier Detection in Graph Streams
-
Outward Influence and Cascade Size Estimation in Billion-scale Networks
-
Overlapping correlation clustering
-
PageRank
-
PageRank on an Evolving Graph
-
Parameterized Algorithms
-
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph ...
-
Personalized Influence Maximization on Social Networks
-
Piggybacking on Social Networks
-
Playing Atari with Deep Reinforcement Learning
-
PMIA
-
Prediction of Information Diffusion Probabilities for Independent Cascade Model
-
Preserving Personalized Pagerank in Subgraphs
-
Probabilistic Solutions of Influence Propagation on Networks
-
Problem Solving in Artificial Intelligence
-
Problem Solving in Artificial Intelligence Lecture 1: introduction
-
Problem Solving in Artificial Intelligence Lecture 2: State Graphs
-
Propagation of Trust and Distrust
-
quasi-clique
-
Rabbit Order: Just-in-time Parallel Reordering for Fast Graph Analysis
-
Random Walks on Graphs: A Survey
-
Random Walks on Graphs: A Survey - 0. Introduction
-
Random Walks on Graphs: A Survey - 1. Basic notions and facts
-
Random Walks on Graphs: A Survey - 2. Main parameters
-
Random Walks with Random Projections
-
Real-Time Influence Maximization on Dynamic Social Streams
-
Real-time Topic-aware Influence Maximization Using Preprocessing
-
Reciprocity in Social Networks with Capacity Constraints
-
Reliable Clustering on Uncertain Graphs
-
Revenue Maximization in Incentivized Social Advertising
-
Robust Influence Maximization (Chen+)
-
Robust Influence Maximization (He-Kempe)
-
Robust Optimization for Non-Convex Objectives
-
Rounded Dynamic Programming for Tree-Structured Stochastic Network Design
-
Sampling Node Pairs Over Large Graphs
-
Scalable and Parallelizable Processing of Influence Maximization for ...
-
Scalable Influence Maximization in Social Networks under the Linear ...
-
Scalable K-Means++
-
Scalable kernels for graphs with continuous attributes
-
Scalable Maximum Clique Computation Using MapReduce
-
Scalable Methods for Adaptively Seeding a Social Network
-
Scalable Similarity Estimation in Social Networks: Closeness, Node Labels, ...
-
Scaling Locally Linear Embedding
-
Selecting Shortcuts for a Smaller World
-
Sensitivity of Diffusion Dynamics to Network Uncertainty
-
Similarity Component Analysis
-
Simpath: An Efficient Algorithm for Influence Maximization under the Linear ...
-
SimRank
-
Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues
-
Spectral Redemption: Clustering Sparse Networks
-
Speedup Graph Processing by Graph Ordering
-
Spheres of Influence for More Effective Viral Marketing
-
Stability of Influence Maximization
-
StaticGreedy
-
StaticGreedy: Solving the Scalability-Accuracy Dilemma in Influence ...
-
StaticGreedy: Solving the Scalability-Accuracy Dilemma in Influence Maximization
-
Stochastic Submodular Maximization: The Case of Coverage Functions
-
Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in ...
-
Streaming Algorithms for k-core Decomposition
-
Streaming Graph Partitioning for Large Distributed Graphs
-
Streaming k-means approximation
-
Streaming k-means on Well-Clusterable Data
-
Streaming Submodular Maximization: Massive Data Summarization on the Fly
-
StreamKM++: A Clustering Algorithm for Data Streams
-
Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large ...
-
submodular
-
test
-
TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in ...
-
The Importance of Communities for Learning to Influence
-
The K-clique Densest Subgraph Problem
-
The matching polytope has exponential extension complexity
-
The Most Reliable Subgraph Problem
-
The Power of Optimization from Samples
-
The Power of Random Neighbors in Social Networks
-
The Price of Stability for Undirected Broadcast Network Design with Fair ...
-
The Pursuit of a Good Possible World: Extracting Representative Instances of ...
-
The query-flow graph: model and applications
-
The Role of Social Networks in Information Diffusion
-
Threshold Models for Competitive Influence in Social Networks
-
Time-Critical Influence Maximization in Social Networks with Time-Delayed ...
-
Top-K Nearest Keyword Search on Large Graphs
-
Top-k Reliability Search on Uncertain Graphs
-
Top-k Reliable Edge Colors in Uncertain Graphs
-
Towards Context-Aware Search by Learning A Very Large Variable Length Hidden ...
-
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and ...
-
Trial and Error in Influential Social Networks
-
Triangle-Based Representative Possible Worlds of Uncertain Graphs
-
TurboISO: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large ...
-
TwitterRank: Finding Topic-sensitive Influential Twitterers
-
UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social ...
-
Uncovering the Temporal Dynamics of Diffusion Networks
-
Using the Triangle Inequality to Accelerate k-Means
-
Vertex Neighborhoods, Low Conductance Cuts, and Good Seeds for Local ...
-
Where Graph Topology Matters: The Robust Subgraph Problem
-
Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and ...
-
Why approximate when you can get the exact? Optimal Targeted Viral Marketing ...
-
Word Alignment via Submodular Maximization over Matroids
-
Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with ...
-
Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm ...
-
サーベイ一覧
-
トップページ
-
メニュー
-
右メニュー
-
情報論的機械学習 10/29
-
気になった論文
-
用語集
-
英単語
-
論文一覧