Statistical Methods in AI: Course Topics
•
0 likes•15 views
The document appears to be a calendar for the month of June. It lists various topics and methods to be discussed on different dates throughout the month, including probabilistic methods, pattern description and recognition, and maximum likelihood estimation. Specific topics mentioned include variational methods, Bayesian inference, and kernel methods. Dates are provided along with day of week abbreviations.
Report
Share
Report
Share
Download to read offline
Recommended
Understanding Raga: Semi Classical forms of Indian music: Course Topics
Course topics for Understanding Raga: Semi Classical forms of Indian music
Taught by: Prof. Saroja TK.
Taught at: IIIT Hyderabad
Real-time systems: Course Topics
Course topics for Real-time systems
Taught by: Prof. Deepak Gangadhran.
Taught at: IIIT Hyderabad
Illumination engineering: Course Topics
Course topics for Illumination engineering
Taught by: Prof. Vishal Garg.
Taught at: IIIT Hyderabad
Scripting and Computer Environments: Course Topics
Course topics for Structural Dynamics
Taught by: Prof.
Taught at: IIIT Hyderabad
Recommended
Understanding Raga: Semi Classical forms of Indian music: Course Topics
Course topics for Understanding Raga: Semi Classical forms of Indian music
Taught by: Prof. Saroja TK.
Taught at: IIIT Hyderabad
Real-time systems: Course Topics
Course topics for Real-time systems
Taught by: Prof. Deepak Gangadhran.
Taught at: IIIT Hyderabad
Illumination engineering: Course Topics
Course topics for Illumination engineering
Taught by: Prof. Vishal Garg.
Taught at: IIIT Hyderabad
Scripting and Computer Environments: Course Topics
Course topics for Structural Dynamics
Taught by: Prof.
Taught at: IIIT Hyderabad
Advanced Operating systems: Course Topics
Course topics for Advanced Operating systems
Taught by: Prof. Manish Srivastava.
Taught at: IIIT Hyderabad
Workshop ideas
A collection of workshop ideas.
Go plan and make something.
For inspiration have a look at Grant Thompson's and Steve Ramsay's work.
Some important differences from Pharmaceutical analysis Manik
Polarography, Conductometry., Amperometry, X-Ray crystallography
Discrete maths# Sets
Written while studying the course Discrete mathematics and Algorithms at IIIT Hyderabad, by professor Bapi Raju S.
Virology Notes 2020 #26: Therapeutic viruses
Virology Lectures 2020 #26: Therapeutic viruses
https://youtu.be/6M0PgaA_V-g
Notes on Virology lectures 2020
Taught by Prof. Vincent Racaniello.
Written by Subhajit Sahu.
Excel prectis Set (Sumit_yadhuvansi).pdf
Excel is a powerful spreadsheet program commonly used for data analysis, calculations, and organizing information.
Principles of Information Security: Course Topics
Course topics for Principles of Information Security
Taught by: Prof. Srinathan Kannan.
Taught at: IIIT Hyderabad
Molecules Of Life Bsc 2nd Semester Chemistry Practical
All life on Earth is built from four different types of molecules. These four types of molecules are often referred to as the molecules of life.
The four molecules of life are proteins, carbohydrates, lipids and nucleic acids. Each of the four groups is vital for every single organism on Earth. Without any of these four molecules, a cell and organism would not be able to live. All of the four molecules of life are important either structurally or functionally for cells and, in most cases, they are important in both ways.
Proteins
Protein - molecules of lifeProteins are the first of the molecules of life and they are really the building blocks of life. Proteins are the most common molecules found in cells. If all the water is removed from a cell, proteins make up more than half of the remaining weight.
Protein molecules are involved in a range of aspects of a cell’s biology. They come in a huge variety of forms and perform a massive range of functions. They are involved in muscle movement, storage of energy, digestion, immune defence and much more.
The primary structure of a protein is a long chain made of many smaller molecules called amino acids. There are 20 different amino acids that are used to build proteins. The different amino acids can be arranged into trillions of different sequences that each creates a unique protein. The long chain of amino acids twists and folds on itself to produce the final shape of a protein.
Amino acids contain nitrogen. Nitrogen-based compounds are an essential part of the diet of all organism so they can produce new proteins for their cells. This is why farmers often add nitrogen-based fertilisers to help their crops grow and why it is important for humans to eat foods that contain proteins.Carbohydrates
The next of the four molecules of life are carbohydrates. Carbohydrates are an important source of energy. They also provide structural support for cells and help with communication between cells.
CarbohydratesA carbohydrate molecule is made of atoms of carbon, hydrogen and oxygen. They are found in the form of either a sugar or many sugars linked together.
A single sugar molecule is known as a monosaccharide. Two sugar molecules bonded together is a disaccharide and many sugar molecules make a polysaccharide. The three different types of carbohydrates are all important for different reasons.
Carbohydrates are the most important sources of energy for many organisms. Plants use the sun’s energy to convert CO₂ into carbohydrates. The energy of these carbohydrates later allows plants to grow and reproduce.
Many organisms have what is known as a cell wall that surrounds their cell. The cell walls of plants and fungi are made from carbohydrates. Cell walls provide important protection for the cells of plants and fungi.
You can learn more about carbohydrates here.
Lipids
Lipids are a highly variable group of molecules that include fats, oils, waxes and some steroids.
Bioassay and Microbiological assay Manik
a) Bioassay: Prerequisites and development, errors in bioassay and how to overcome them. Statistical design of bioassay.
b) Principles of Microbiological Analysis (diffusion method) of the Following Drugs:
(i) Microbiological Assay: Antibiotics, vitamins, sulfa drugs
More Related Content
What's hot
Advanced Operating systems: Course Topics
Course topics for Advanced Operating systems
Taught by: Prof. Manish Srivastava.
Taught at: IIIT Hyderabad
Workshop ideas
A collection of workshop ideas.
Go plan and make something.
For inspiration have a look at Grant Thompson's and Steve Ramsay's work.
Some important differences from Pharmaceutical analysis Manik
Polarography, Conductometry., Amperometry, X-Ray crystallography
Discrete maths# Sets
Written while studying the course Discrete mathematics and Algorithms at IIIT Hyderabad, by professor Bapi Raju S.
What's hot (9)
Some important differences from Pharmaceutical analysis Manik
Some important differences from Pharmaceutical analysis Manik
Similar to Statistical Methods in AI: Course Topics
Virology Notes 2020 #26: Therapeutic viruses
Virology Lectures 2020 #26: Therapeutic viruses
https://youtu.be/6M0PgaA_V-g
Notes on Virology lectures 2020
Taught by Prof. Vincent Racaniello.
Written by Subhajit Sahu.
Excel prectis Set (Sumit_yadhuvansi).pdf
Excel is a powerful spreadsheet program commonly used for data analysis, calculations, and organizing information.
Principles of Information Security: Course Topics
Course topics for Principles of Information Security
Taught by: Prof. Srinathan Kannan.
Taught at: IIIT Hyderabad
Molecules Of Life Bsc 2nd Semester Chemistry Practical
All life on Earth is built from four different types of molecules. These four types of molecules are often referred to as the molecules of life.
The four molecules of life are proteins, carbohydrates, lipids and nucleic acids. Each of the four groups is vital for every single organism on Earth. Without any of these four molecules, a cell and organism would not be able to live. All of the four molecules of life are important either structurally or functionally for cells and, in most cases, they are important in both ways.
Proteins
Protein - molecules of lifeProteins are the first of the molecules of life and they are really the building blocks of life. Proteins are the most common molecules found in cells. If all the water is removed from a cell, proteins make up more than half of the remaining weight.
Protein molecules are involved in a range of aspects of a cell’s biology. They come in a huge variety of forms and perform a massive range of functions. They are involved in muscle movement, storage of energy, digestion, immune defence and much more.
The primary structure of a protein is a long chain made of many smaller molecules called amino acids. There are 20 different amino acids that are used to build proteins. The different amino acids can be arranged into trillions of different sequences that each creates a unique protein. The long chain of amino acids twists and folds on itself to produce the final shape of a protein.
Amino acids contain nitrogen. Nitrogen-based compounds are an essential part of the diet of all organism so they can produce new proteins for their cells. This is why farmers often add nitrogen-based fertilisers to help their crops grow and why it is important for humans to eat foods that contain proteins.Carbohydrates
The next of the four molecules of life are carbohydrates. Carbohydrates are an important source of energy. They also provide structural support for cells and help with communication between cells.
CarbohydratesA carbohydrate molecule is made of atoms of carbon, hydrogen and oxygen. They are found in the form of either a sugar or many sugars linked together.
A single sugar molecule is known as a monosaccharide. Two sugar molecules bonded together is a disaccharide and many sugar molecules make a polysaccharide. The three different types of carbohydrates are all important for different reasons.
Carbohydrates are the most important sources of energy for many organisms. Plants use the sun’s energy to convert CO₂ into carbohydrates. The energy of these carbohydrates later allows plants to grow and reproduce.
Many organisms have what is known as a cell wall that surrounds their cell. The cell walls of plants and fungi are made from carbohydrates. Cell walls provide important protection for the cells of plants and fungi.
You can learn more about carbohydrates here.
Lipids
Lipids are a highly variable group of molecules that include fats, oils, waxes and some steroids.
Bioassay and Microbiological assay Manik
a) Bioassay: Prerequisites and development, errors in bioassay and how to overcome them. Statistical design of bioassay.
b) Principles of Microbiological Analysis (diffusion method) of the Following Drugs:
(i) Microbiological Assay: Antibiotics, vitamins, sulfa drugs
Delta modularity derivation (Louvain algorithm) : NOTES
Simplifying expression for delta modularity (Louvain algorithm).
For details, see here: https://www.youtube.com/watch?v=0zuiLBOIcsw
The Louvain method for community detection is a method to extract communities from large networks created by Blondel et al.[1] from the University of Louvain (the source of this method's name). The method is a greedy optimization method that appears to run in time {\displaystyle O(n\cdot \log n)}O(n\cdot \log n) if {\displaystyle n}n is the number of nodes in the network.[2]
Group of Poems (2018-20)
କବିତା ଗୋଷ୍ଠୀ |
- in-a-year-when-it-rains
- all-are-our-own
- let-the-plague-go
- breaking-selfish-love
- your-feets-dust
- oh-my-god-come-to-us
- we-honor-them
- why-could-i-not-find
- biography-of-a-palm-tree
- all-your-gifts
- unspoken-definition
- a-request-to-you
- a-new-experience
Monetary Policy committee_Project work class 12
Monetary Policy committee_Project work class 12
Class 12 practical file economics
Economics project file
Economics project on monetary policy
Similar to Statistical Methods in AI: Course Topics (20)
Suzuki guitar-vol-7-141212224605-conversion-gate02
Suzuki guitar-vol-7-141212224605-conversion-gate02
Molecules Of Life Bsc 2nd Semester Chemistry Practical
Molecules Of Life Bsc 2nd Semester Chemistry Practical
Yarn 2/1 ----Study on a draft calculation of draw frame
Yarn 2/1 ----Study on a draft calculation of draw frame
Three County Fairgrounds Stormwater Permit Plans 11-03-2010
Three County Fairgrounds Stormwater Permit Plans 11-03-2010
MTH 401 UNIT 2.pdf this is for unit 2 form lovely professional University
MTH 401 UNIT 2.pdf this is for unit 2 form lovely professional University
Solution Manual of Design of Concrete Structure, Aurther H. Nelson(13th Editi...
Solution Manual of Design of Concrete Structure, Aurther H. Nelson(13th Editi...
Delta modularity derivation (Louvain algorithm) : NOTES
Delta modularity derivation (Louvain algorithm) : NOTES
More from Subhajit Sahu
About TrueTime, Spanner, Clock synchronization, CAP theorem, Two-phase lockin...
TrueTime is a service that enables the use of globally synchronized clocks, with bounded error. It returns a time interval that is guaranteed to contain the clock’s actual time for some time during the call’s execution. If two intervals do not overlap, then we know calls were definitely ordered in real time. In general, synchronized clocks can be used to avoid communication in a distributed system.
The underlying source of time is a combination of GPS receivers and atomic clocks. As there are “time masters” in every datacenter (redundantly), it is likely that both sides of a partition would continue to enjoy accurate time. Individual nodes however need network connectivity to the masters, and without it their clocks will drift. Thus, during a partition their intervals slowly grow wider over time, based on bounds on the rate of local clock drift. Operations depending on TrueTime, such as Paxos leader election or transaction commits, thus have to wait a little longer, but the operation still completes (assuming the 2PC and quorum communication are working).
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
Adjusting Bitset for graph : SHORT REPORT / NOTES
Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is commonly used for efficient graph computations. Unfortunately, using CSR for dynamic graphs is impractical since addition/deletion of a single edge can require on average (N+M)/2 memory accesses, in order to update source-offsets and destination-indices. A common approach is therefore to store edge-lists/destination-indices as an array of arrays, where each edge-list is an array belonging to a vertex. While this is good enough for small graphs, it quickly becomes a bottleneck for large graphs. What causes this bottleneck depends on whether the edge-lists are sorted or unsorted. If they are sorted, checking for an edge requires about log(E) memory accesses, but adding an edge on average requires E/2 accesses, where E is the number of edges of a given vertex. Note that both addition and deletion of edges in a dynamic graph require checking for an existing edge, before adding or deleting it. If edge lists are unsorted, checking for an edge requires around E/2 memory accesses, but adding an edge requires only 1 memory access.
Algorithmic optimizations for Dynamic Levelwise PageRank (from STICD) : SHORT...
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
Adjusting primitives for graph : SHORT REPORT / NOTES
Graph algorithms, like PageRank Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is
Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
Experiments with Primitive operations : SHORT REPORT / NOTES
This includes:
- Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
- Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
- Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
- Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
PageRank Experiments : SHORT REPORT / NOTES
This includes:
- Adjusting data types for rank vector
- Adjusting Pagerank parameters
- Adjusting Sequential approach
- Adjusting OpenMP approach
- Comparing sequential approach
- Adjusting Monolithic (Sequential) optimizations (from STICD)
- Adjusting Levelwise (STICD) approach
- Comparing Levelwise (STICD) approach
- Adjusting ranks for dynamic graphs
- Adjusting Levelwise (STICD) dynamic approach
- Comparing dynamic approach with static
- Adjusting Monolithic CUDA approach
- Adjusting Monolithic CUDA optimizations (from STICD)
- Adjusting Levelwise (STICD) CUDA approach
- Comparing Levelwise (STICD) CUDA approach
- Comparing dynamic CUDA approach with static
- Comparing dynamic optimized CUDA approach with static
Algorithmic optimizations for Dynamic Monolithic PageRank (from STICD) : SHOR...
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
Adjusting OpenMP PageRank : SHORT REPORT / NOTES
For massive graphs that fit in RAM, but not in GPU memory, it is possible to take
advantage of a shared memory system with multiple CPUs, each with multiple cores, to
accelerate pagerank computation. If the NUMA architecture of the system is properly taken
into account with good vertex partitioning, the speedup can be significant. To take steps in
this direction, experiments are conducted to implement pagerank in OpenMP using two
different approaches, uniform and hybrid. The uniform approach runs all primitives required
for pagerank in OpenMP mode (with multiple threads). On the other hand, the hybrid
approach runs certain primitives in sequential mode (i.e., sumAt, multiply).
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings o...
Below are the important points I note from the 2020 paper by Martin Grohe:
- 1-WL distinguishes almost all graphs, in a probabilistic sense
- Classical WL is two dimensional Weisfeiler-Leman
- DeepWL is an unlimited version of WL graph that runs in polynomial time.
- Knowledge graphs are essentially graphs with vertex/edge attributes
ABSTRACT:
Vector representations of graphs and relational structures, whether handcrafted feature vectors or learned representations, enable us to apply standard data analysis and machine learning techniques to the structures. A wide range of methods for generating such embeddings have been studied in the machine learning and knowledge representation literature. However, vector embeddings have received relatively little attention from a theoretical point of view.
Starting with a survey of embedding techniques that have been used in practice, in this paper we propose two theoretical approaches that we see as central for understanding the foundations of vector embeddings. We draw connections between the various approaches and suggest directions for future research.
DyGraph: A Dynamic Graph Generator and Benchmark Suite : NOTES
https://gist.github.com/wolfram77/54c4a14d9ea547183c6c7b3518bf9cd1
There exist a number of dynamic graph generators. Barbasi-Albert model iteratively attach new vertices to pre-exsiting vertices in the graph using preferential attachment (edges to high degree vertices are more likely - rich get richer - Pareto principle). However, graph size increases monotonically, and density of graph keeps increasing (sparsity decreasing).
Gorke's model uses a defined clustering to uniformly add vertices and edges. Purohit's model uses motifs (eg. triangles) to mimick properties of existing dynamic graphs, such as growth rate, structure, and degree distribution. Kronecker graph generators are used to increase size of a given graph, with power-law distribution.
To generate dynamic graphs, we must choose a metric to compare two graphs. Common metrics include diameter, clustering coefficient (modularity?), triangle counting (triangle density?), and degree distribution.
In this paper, the authors propose Dygraph, a dynamic graph generator that uses degree distribution as the only metric. The authors observe that many real-world graphs differ from the power-law distribution at the tail end. To address this issue, they propose binning, where the vertices beyond a certain degree (minDeg = min(deg) s.t. |V(deg)| < H, where H~10 is the number of vertices with a given degree below which are binned) are grouped into bins of degree-width binWidth, max-degree localMax, and number of degrees in bin with at least one vertex binSize (to keep track of sparsity). This helps the authors to generate graphs with a more realistic degree distribution.
The process of generating a dynamic graph is as follows. First the difference between the desired and the current degree distribution is calculated. The authors then create an edge-addition set where each vertex is present as many times as the number of additional incident edges it must recieve. Edges are then created by connecting two vertices randomly from this set, and removing both from the set once connected. Currently, authors reject self-loops and duplicate edges. Removal of edges is done in a similar fashion.
Authors observe that adding edges with power-law properties dominates the execution time, and consider parallelizing DyGraph as part of future work.
Shared memory Parallelism (NOTES)
My notes on shared memory parallelism.
Shared memory is memory that may be simultaneously accessed by multiple programs with an intent to provide communication among them or avoid redundant copies. Shared memory is an efficient means of passing data between programs. Using memory for communication inside a single program, e.g. among its multiple threads, is also referred to as shared memory [REF].
A Dynamic Algorithm for Local Community Detection in Graphs : NOTES
**Community detection methods** can be *global* or *local*. **Global community detection methods** divide the entire graph into groups. Existing global algorithms include:
- Random walk methods
- Spectral partitioning
- Label propagation
- Greedy agglomerative and divisive algorithms
- Clique percolation
https://gist.github.com/wolfram77/b4316609265b5b9f88027bbc491f80b6
There is a growing body of work in *detecting overlapping communities*. **Seed set expansion** is a **local community detection method** where a relevant *seed vertices* of interest are picked and *expanded to form communities* surrounding them. The quality of each community is measured using a *fitness function*.
**Modularity** is a *fitness function* which compares the number of intra-community edges to the expected number in a random-null model. **Conductance** is another popular fitness score that measures the community cut or inter-community edges. Many *overlapping community detection* methods **use a modified ratio** of intra-community edges to all edges with atleast one endpoint in the community.
Andersen et al. use a **Spectral PageRank-Nibble method** which minimizes conductance and is formed by adding vertices in order of decreasing PageRank values. Andersen and Lang develop a **random walk approach** in which some vertices in the seed set may not be placed in the final community. Clauset gives a **greedy method** that *starts from a single vertex* and then iteratively adds neighboring vertices *maximizing the local modularity score*. Riedy et al. **expand multiple vertices** via maximizing modularity.
Several algorithms for **detecting global, overlapping communities** use a *greedy*, *agglomerative approach* and run *multiple separate seed set expansions*. Lancichinetti et al. run **greedy seed set expansions**, each with a *single seed vertex*. Overlapping communities are produced by a sequentially running expansions from a node not yet in a community. Lee et al. use **maximal cliques as seed sets**. Havemann et al. **greedily expand cliques**.
The authors of this paper discuss a dynamic approach for **community detection using seed set expansion**. Simply marking the neighbours of changed vertices is a **naive approach**, and has *severe shortcomings*. This is because *communities can split apart*. The simple updating method *may fail even when it outputs a valid community* in the graph.
Scalable Static and Dynamic Community Detection Using Grappolo : NOTES
A **community** (in a network) is a subset of nodes which are _strongly connected among themselves_, but _weakly connected to others_. Neither the number of output communities nor their size distribution is known a priori. Community detection methods can be divisive or agglomerative. **Divisive methods** use _betweeness centrality_ to **identify and remove bridges** between communities. **Agglomerative methods** greedily **merge two communities** that provide maximum gain in _modularity_. Newman and Girvan have introduced the **modularity metric**. The problem of community detection is then reduced to the problem of modularity maximization which is **NP-complete**. **Louvain method** is a variant of the _agglomerative strategy_, in that is a _multi-level heuristic_.
https://gist.github.com/wolfram77/917a1a4a429e89a0f2a1911cea56314d
In this paper, the authors discuss **four heuristics** for Community detection using the _Louvain algorithm_ implemented upon recently developed **Grappolo**, which is a parallel variant of the Louvain algorithm. They are:
- Vertex following and Minimum label
- Data caching
- Graph coloring
- Threshold scaling
With the **Vertex following** heuristic, the _input is preprocessed_ and all single-degree vertices are merged with their corresponding neighbours. This helps reduce the number of vertices considered in each iteration, and also help initial seeds of communities to be formed. With the **Minimum label heuristic**, when a vertex is making the decision to move to a community and multiple communities provided the same modularity gain, the community with the smallest id is chosen. This helps _minimize or prevent community swaps_. With the **Data caching** heuristic, community information is stored in a vector instead of a map, and is reused in each iteration, but with some additional cost. With the **Vertex ordering via Graph coloring** heuristic, _distance-k coloring_ of graphs is performed in order to group vertices into colors. Then, each set of vertices (by color) is processed _concurrently_, and synchronization is performed after that. This enables us to mimic the behaviour of the serial algorithm. Finally, with the **Threshold scaling** heuristic, _successively smaller values of modularity threshold_ are used as the algorithm progresses. This allows the algorithm to converge faster, and it has been observed a good modularity score as well.
From the results, it appears that _graph coloring_ and _threshold scaling_ heuristics do not always provide a speedup and this depends upon the nature of the graph. It would be interesting to compare the heuristics against baseline approaches. Future work can include _distributed memory implementations_, and _community detection on streaming graphs_.
Application Areas of Community Detection: A Review : NOTES
This is a short review of Community detection methods (on graphs), and their applications. A **community** is a subset of a network whose members are *highly connected*, but *loosely connected* to others outside their community. Different community detection methods *can return differing communities* these algorithms are **heuristic-based**. **Dynamic community detection** involves tracking the *evolution of community structure* over time.
https://gist.github.com/wolfram77/09e64d6ba3ef080db5558feb2d32fdc0
Communities can be of the following **types**:
- Disjoint
- Overlapping
- Hierarchical
- Local.
The following **static** community detection **methods** exist:
- Spectral-based
- Statistical inference
- Optimization
- Dynamics-based
The following **dynamic** community detection **methods** exist:
- Independent community detection and matching
- Dependent community detection (evolutionary)
- Simultaneous community detection on all snapshots
- Dynamic community detection on temporal networks
**Applications** of community detection include:
- Criminal identification
- Fraud detection
- Criminal activities detection
- Bot detection
- Dynamics of epidemic spreading (dynamic)
- Cancer/tumor detection
- Tissue/organ detection
- Evolution of influence (dynamic)
- Astroturfing
- Customer segmentation
- Recommendation systems
- Social network analysis (both)
- Network summarization
- Privary, group segmentation
- Link prediction (both)
- Community evolution prediction (dynamic, hot field)
<br>
<br>
## References
- [Application Areas of Community Detection: A Review : PAPER](https://ieeexplore.ieee.org/document/8625349)
Community Detection on the GPU : NOTES
This paper discusses a GPU implementation of the Louvain community detection algorithm. Louvain algorithm obtains hierachical communities as a dendrogram through modularity optimization. Given an undirected weighted graph, all vertices are first considered to be their own communities. In the first phase, each vertex greedily decides to move to the community of one of its neighbours which gives greatest increase in modularity. If moving to no neighbour's community leads to an increase in modularity, the vertex chooses to stay with its own community. This is done sequentially for all the vertices. If the total change in modularity is more than a certain threshold, this phase is repeated. Once this local moving phase is complete, all vertices have formed their first hierarchy of communities. The next phase is called the aggregation phase, where all the vertices belonging to a community are collapsed into a single super-vertex, such that edges between communities are represented as edges between respective super-vertices (edge weights are combined), and edges within each community are represented as self-loops in respective super-vertices (again, edge weights are combined). Together, the local moving and the aggregation phases constitute a stage. This super-vertex graph is then used as input fof the next stage. This process continues until the increase in modularity is below a certain threshold. As a result from each stage, we have a hierarchy of community memberships for each vertex as a dendrogram.
Approaches to perform the Louvain algorithm can be divided into coarse-grained and fine-grained. Coarse-grained approaches process a set of vertices in parallel, while fine-grained approaches process all vertices in parallel. A coarse-grained hybrid-GPU algorithm using multi GPUs has be implemented by Cheong et al. which grabbed my attention. In addition, their algorithm does not use hashing for the local moving phase, but instead sorts each neighbour list based on the community id of each vertex.
https://gist.github.com/wolfram77/7e72c9b8c18c18ab908ae76262099329
Survey for extra-child-process package : NOTES
Useful additions to inbuilt child_process module.
📦 Node.js, 📜 Files, 📰 Docs.
Please see attached PDF for literature survey.
https://gist.github.com/wolfram77/d936da570d7bf73f95d1513d4368573e
Dynamic Batch Parallel Algorithms for Updating PageRank : POSTER
For the PhD forum an abstract submission is required by 10th May, and poster by 15th May. The event is on 30th May.
https://gist.github.com/wolfram77/692d263f463fd49be6eb5aa65dd4d0f9
Abstract for IPDPS 2022 PhD Forum on Dynamic Batch Parallel Algorithms for Up...
For the PhD forum an abstract submission is required by 10th May, and poster by 15th May. The event is on 30th May.
https://gist.github.com/wolfram77/1c1f730d20b51e0d2c6d477fd3713024
Fast Incremental Community Detection on Dynamic Graphs : NOTES
In this paper, the authors describe two approaches for dynamic community detection using the CNM algorithm. CNM is a hierarchical, agglomerative algorithm that greedily maximizes modularity. They define two approaches: BasicDyn and FastDyn. BasicDyn backtracks merges of communities until each marked (changed) vertex is its own singleton community. FastDyn undoes a merge only if the quality of merge, as measured by the induced change in modularity, has significantly decreased compared to when the merge initially took place. FastDyn also allows more than two vertices to contract together if in the previous time step these vertices eventually ended up contracted in the same community. In the static case, merging several vertices together in one contraction phase could lead to deteriorating results. FastDyn is able to do this, however, because it uses information from the merges of the previous time step. Intuitively, merges that previously occurred are more likely to be acceptable later.
https://gist.github.com/wolfram77/1856b108334cc822cdddfdfa7334792a
More from Subhajit Sahu (20)
About TrueTime, Spanner, Clock synchronization, CAP theorem, Two-phase lockin...
About TrueTime, Spanner, Clock synchronization, CAP theorem, Two-phase lockin...
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...
Algorithmic optimizations for Dynamic Levelwise PageRank (from STICD) : SHORT...
Algorithmic optimizations for Dynamic Levelwise PageRank (from STICD) : SHORT...
Adjusting primitives for graph : SHORT REPORT / NOTES
Adjusting primitives for graph : SHORT REPORT / NOTES
Experiments with Primitive operations : SHORT REPORT / NOTES
Experiments with Primitive operations : SHORT REPORT / NOTES
Algorithmic optimizations for Dynamic Monolithic PageRank (from STICD) : SHOR...
Algorithmic optimizations for Dynamic Monolithic PageRank (from STICD) : SHOR...
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings o...
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings o...
DyGraph: A Dynamic Graph Generator and Benchmark Suite : NOTES
DyGraph: A Dynamic Graph Generator and Benchmark Suite : NOTES
A Dynamic Algorithm for Local Community Detection in Graphs : NOTES
A Dynamic Algorithm for Local Community Detection in Graphs : NOTES
Scalable Static and Dynamic Community Detection Using Grappolo : NOTES
Scalable Static and Dynamic Community Detection Using Grappolo : NOTES
Application Areas of Community Detection: A Review : NOTES
Application Areas of Community Detection: A Review : NOTES
Dynamic Batch Parallel Algorithms for Updating PageRank : POSTER
Dynamic Batch Parallel Algorithms for Updating PageRank : POSTER
Abstract for IPDPS 2022 PhD Forum on Dynamic Batch Parallel Algorithms for Up...
Abstract for IPDPS 2022 PhD Forum on Dynamic Batch Parallel Algorithms for Up...
Fast Incremental Community Detection on Dynamic Graphs : NOTES
Fast Incremental Community Detection on Dynamic Graphs : NOTES
Recently uploaded
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Acetabularia Information For Class 9 .docx
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Embracing GenAI - A Strategic Imperative
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiBest Digital Marketing Institute In NOIDA
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Recently uploaded (20)
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Multithreading_in_C++ - std::thread, race condition
Multithreading_in_C++ - std::thread, race condition
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Statistical Methods in AI: Course Topics
- 1. 2018~ - - -- - - - - -- - --- t_ ____ JUNE Week 25 l~~- 1GS£!j_JJ ..SJ A1 I.S.llLJ'1L ME'UIO)$ IN Ai Wednesday 20 -- - - - ----------------- 11 ~ugE ToP Ll 12 b 2 • v:c ndc:ro Vor ('cdnl€J ) p re bo bi"-~lhd cl.Q_oc.9l-b'~-B.~- - _3 ___ l'.'.b l ; I-h' vor1'oh. cLw -~lft'e.,') '- • - 0.Ctl~V Q. ho,t, u C[q S.Sr'1:j,......~ ------ --- - ----- - ~- - - ~ - - - - -- - - - - - - - - - - - 7 .. --- - - - - - - - - - - - - - - - -- - - - - ---- - - - - - - - - - - - - - - - - .. {-0~J'.s.t·i.c._ -~ ~-'~ t-- - - - - - - - - 6 S MTW TFS - - - - - - - -- - - - - - - ~S M_ T_WTFS S M T WT F S S M T WT F S S M T W T F S 1 2 ~ 3 _ 4 :_::__ 5 ~6'.__'.__ 7 ~8~9~10~1~1~12~13~1~4_21~5~16~17~1~8~19~~~21~ ~~23~2~42~5~26~2~7~28_::~~3~0-31- ·-·_·_ · i ►C C'l C (/l -i
- 2. r r•' . t-t t B,I ?.en2£i :...::JU~N_:_::E'._____ _ _ _ _ _ __ __ ________2-_ ~ 21 Week2s Thursday ,172.191 __. _ Y)_g_u.rn__L J'J.~.Jw _o__d~5.L,-- ··b__oL~~r_o__µ~.fl-h'0 V) r _ 9 - - ~eJ:h_o___clL----------- J ,- • ' tLCi.f ~ .l. Y)_0 11 -------------------~-------..:?...._ -~ 12 '" ml:x- rn~,'n clc,~!,.l'bi'co-b'nYJ (.svr-1) > Qv/1,J 1LCu:iccJU:!,--- 1<-eY'Yl a 1· 20 +:t'oY1 -;r--- . ' 3 6 t• pattern dcs~d t'ta:hbY) • olocla . 'D -, ~-- - - - - - - - - - - - S MTWTFS S M T W T F S 3 456789 S M T W T F S 10 11 12 13 14 15 16 S MTWTFS S MTWTFS 17 18 19 20 21 22 23 24 25 26 27 28 29~