imager package in R and example
References:
http://dahtah.github.io/imager/
http://dahtah.github.io/imager/imager.html
https://cran.r-project.org/web/packages/imager/imager.pdf
ref:https://www.ggplot2-exts.org/ggtree.html
ggtree
https://bioconductor.org/packages/release/bioc/html/ggtree.html
gtree is designed for visualizing phylogenetic tree and different types of associated annotation data.
A short list of the most useful R commands
reference: http://www.personality-project.org/r/r.commands.html
R programı ile ilgilenen veya yeni öğrenmeye başlayan herkes için hazırlanmıştır.
Data visualization with R.
Mosaic plot .
---Ref: https://www.stat.auckland.ac.nz/~ihaka/120/Lectures/lecture17.pdf
http://www.statmethods.net/advgraphs/mosaic.html
https://stat.ethz.ch/R-manual/R-devel/library/graphics/html/mosaicplot.html
imager package in R and example
References:
http://dahtah.github.io/imager/
http://dahtah.github.io/imager/imager.html
https://cran.r-project.org/web/packages/imager/imager.pdf
ref:https://www.ggplot2-exts.org/ggtree.html
ggtree
https://bioconductor.org/packages/release/bioc/html/ggtree.html
gtree is designed for visualizing phylogenetic tree and different types of associated annotation data.
A short list of the most useful R commands
reference: http://www.personality-project.org/r/r.commands.html
R programı ile ilgilenen veya yeni öğrenmeye başlayan herkes için hazırlanmıştır.
Data visualization with R.
Mosaic plot .
---Ref: https://www.stat.auckland.ac.nz/~ihaka/120/Lectures/lecture17.pdf
http://www.statmethods.net/advgraphs/mosaic.html
https://stat.ethz.ch/R-manual/R-devel/library/graphics/html/mosaicplot.html
Data Science and its Relationship to Big Data and Data-Driven Decision MakingDr. Volkan OBAN
Data Science and its Relationship to Big Data and Data-Driven Decision Making
To cite this article:
Foster Provost and Tom Fawcett. Big Data. February 2013, 1(1): 51-59. doi:10.1089/big.2013.1508.
Foster Provost and Tom Fawcett
Published in Volume: 1 Issue 1: February 13, 2013
ref:http://online.liebertpub.com/doi/full/10.1089/big.2013.1508
https://www.researchgate.net/publication/256439081_Data_Science_and_Its_Relationship_to_Big_Data_and_Data-Driven_Decision_Making
R Machine Learning packages( generally used)
prepared by Volkan OBAN
reference:
https://github.com/josephmisiti/awesome-machine-learning#r-general-purpose
k-means Clustering and Custergram with R.
K Means Clustering is an unsupervised learning algorithm that tries to cluster data based on their similarity. Unsupervised learning means that there is no outcome to be predicted, and the algorithm just tries to find patterns in the data. In k means clustering, we have the specify the number of clusters we want the data to be grouped into. The algorithm randomly assigns each observation to a cluster, and finds the centroid of each cluster.
ref:https://www.r-bloggers.com/k-means-clustering-in-r/
ref:https://rpubs.com/FelipeRego/K-Means-Clustering
ref:https://www.r-bloggers.com/clustergram-visualization-and-diagnostics-for-cluster-analysis-r-code/
Some R Examples[R table and Graphics] -Advanced Data Visualization in R (Some...Dr. Volkan OBAN
Some R Examples[R table and Graphics]
Advanced Data Visualization in R (Some Examples)
References:
http://zevross.com/blog/2014/08/04/beautiful-plotting-in-r-a-ggplot2-cheatsheet-3/
http://www.cookbook-r.com/
http://moderndata.plot.ly/trisurf-plots-in-r-using-plotly/
I hope that it would ne useful for UseRs.
Umarım; R programı ile ilgilenen herkes için yararlı olur.
Volkan OBAN
Forecasting through ARIMA Modeling using R
ref:http://ucanalytics.com/blogs/step-by-step-graphic-guide-to-forecasting-through-arima-modeling-in-r-manufacturing-case-study-example/
Covid19py by Konstantinos Kamaropoulos
A tiny Python package for easy access to up-to-date Coronavirus (COVID-19, SARS-CoV-2) cases data.
ref:https://github.com/Kamaropoulos/COVID19Py
https://pypi.org/project/COVID19Py/?fbclid=IwAR0zFKe_1Y6Nm0ak1n0W1ucFZcVT4VBWEP4LOFHJP-DgoL32kx3JCCxkGLQ
"optrees" package in R and examples.(optrees:finds optimal trees in weighted ...Dr. Volkan OBAN
Finds optimal trees in weighted graphs. In
particular, this package provides solving tools for minimum cost spanning
tree problems, minimum cost arborescence problems, shortest path tree
problems and minimum cut tree problem.
by Volkan OBAN
k-means Clustering in Python
scikit-learn--Machine Learning in Python
from sklearn.cluster import KMeans
k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.
The problem is computationally difficult (NP-hard); however, there are efficient heuristic algorithms that are commonly employed and converge quickly to a local optimum. These are usually similar to the expectation-maximization algorithm for mixtures of Gaussian distributions via an iterative refinement approach employed by both algorithms. Additionally, they both use cluster centers to model the data; however, k-means clustering tends to find clusters of comparable spatial extent, while the expectation-maximization mechanism allows clusters to have different shapes.[wikipedia]
ref: http://scikit-learn.org/stable/auto_examples/cluster/plot_cluster_iris.html
Data Science and its Relationship to Big Data and Data-Driven Decision MakingDr. Volkan OBAN
Data Science and its Relationship to Big Data and Data-Driven Decision Making
To cite this article:
Foster Provost and Tom Fawcett. Big Data. February 2013, 1(1): 51-59. doi:10.1089/big.2013.1508.
Foster Provost and Tom Fawcett
Published in Volume: 1 Issue 1: February 13, 2013
ref:http://online.liebertpub.com/doi/full/10.1089/big.2013.1508
https://www.researchgate.net/publication/256439081_Data_Science_and_Its_Relationship_to_Big_Data_and_Data-Driven_Decision_Making
R Machine Learning packages( generally used)
prepared by Volkan OBAN
reference:
https://github.com/josephmisiti/awesome-machine-learning#r-general-purpose
k-means Clustering and Custergram with R.
K Means Clustering is an unsupervised learning algorithm that tries to cluster data based on their similarity. Unsupervised learning means that there is no outcome to be predicted, and the algorithm just tries to find patterns in the data. In k means clustering, we have the specify the number of clusters we want the data to be grouped into. The algorithm randomly assigns each observation to a cluster, and finds the centroid of each cluster.
ref:https://www.r-bloggers.com/k-means-clustering-in-r/
ref:https://rpubs.com/FelipeRego/K-Means-Clustering
ref:https://www.r-bloggers.com/clustergram-visualization-and-diagnostics-for-cluster-analysis-r-code/
Some R Examples[R table and Graphics] -Advanced Data Visualization in R (Some...Dr. Volkan OBAN
Some R Examples[R table and Graphics]
Advanced Data Visualization in R (Some Examples)
References:
http://zevross.com/blog/2014/08/04/beautiful-plotting-in-r-a-ggplot2-cheatsheet-3/
http://www.cookbook-r.com/
http://moderndata.plot.ly/trisurf-plots-in-r-using-plotly/
I hope that it would ne useful for UseRs.
Umarım; R programı ile ilgilenen herkes için yararlı olur.
Volkan OBAN
Forecasting through ARIMA Modeling using R
ref:http://ucanalytics.com/blogs/step-by-step-graphic-guide-to-forecasting-through-arima-modeling-in-r-manufacturing-case-study-example/
Covid19py by Konstantinos Kamaropoulos
A tiny Python package for easy access to up-to-date Coronavirus (COVID-19, SARS-CoV-2) cases data.
ref:https://github.com/Kamaropoulos/COVID19Py
https://pypi.org/project/COVID19Py/?fbclid=IwAR0zFKe_1Y6Nm0ak1n0W1ucFZcVT4VBWEP4LOFHJP-DgoL32kx3JCCxkGLQ
"optrees" package in R and examples.(optrees:finds optimal trees in weighted ...Dr. Volkan OBAN
Finds optimal trees in weighted graphs. In
particular, this package provides solving tools for minimum cost spanning
tree problems, minimum cost arborescence problems, shortest path tree
problems and minimum cut tree problem.
by Volkan OBAN
k-means Clustering in Python
scikit-learn--Machine Learning in Python
from sklearn.cluster import KMeans
k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.
The problem is computationally difficult (NP-hard); however, there are efficient heuristic algorithms that are commonly employed and converge quickly to a local optimum. These are usually similar to the expectation-maximization algorithm for mixtures of Gaussian distributions via an iterative refinement approach employed by both algorithms. Additionally, they both use cluster centers to model the data; however, k-means clustering tends to find clusters of comparable spatial extent, while the expectation-maximization mechanism allows clusters to have different shapes.[wikipedia]
ref: http://scikit-learn.org/stable/auto_examples/cluster/plot_cluster_iris.html
R Data Visualization-Spatial data and Maps in R: Using R as a GISDr. Volkan OBAN
R Data Visualization-Spatial data and Maps in R: Using R as a GIS
Reference: https://pakillo.github.io/R-GIS-tutorial/
Basic packages
library(sp) # classes for spatial data
library(raster) # grids, rasters
library(rasterVis) # raster visualization
library(maptools)
library(rgeos)
library(dismo)
library(googleVis)
library(rworldmap)
library(RgoogleMaps)
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.