Subscribe to DSC Newsletter
Faramarz Azadegan
  • Male
  • La Jolla
  • United States
Share on Facebook
Share

Gifts Received

Gift

Faramarz Azadegan has not received any gifts yet

Give a Gift

 

Faramarz Azadegan's Page

Latest Activity

Faramarz Azadegan posted a blog post

Python Software for Clustering

In an earlier description of clustering algorithms we described an algorithm by which locally optimum partitions and center of gravity of multi-dimensional vectors/points may be obtained. If only one or two dimensional data are considered the optimum partitioning to obtain the so-called Voronoi regions are known. For one-dimension it is the interval while for two-dimensions it is hexagon (think of honey-bee nests or cellular phone tower positioning and the 2-D tessellation of 2-D space for…See More
Jun 23
Faramarz Azadegan's blog post was featured

Python Software for Clustering

In an earlier description of clustering algorithms we described an algorithm by which locally optimum partitions and center of gravity of multi-dimensional vectors/points may be obtained. If only one or two dimensional data are considered the optimum partitioning to obtain the so-called Voronoi regions are known. For one-dimension it is the interval while for two-dimensions it is hexagon (think of honey-bee nests or cellular phone tower positioning and the 2-D tessellation of 2-D space for…See More
Jun 23

Profile Information

My Web Site Or LinkedIn Profile
http://www.linkedin.com/in/faramarzazadegan/
Professional Status
Executive Management
Years of Experience:
30
Your Company:
MutliMediaXmission
Industry:
video communication
Your Job Title:
Founder
How did you find out about DataScienceCentral?
friend
Interests:
Finding a new position, Networking
What is your Favorite Data Mining or Analytical Website?
http://[email protected]

Faramarz Azadegan's Blog

Python Software for Clustering

Posted on June 19, 2019 at 9:35am 0 Comments

In an earlier description of clustering algorithms we described an algorithm by which locally optimum partitions and center of gravity of multi-dimensional vectors/points may be obtained. If only one or two dimensional data are considered the optimum partitioning to obtain the so-called Voronoi regions are known. For one-dimension it is the interval while for two-dimensions it is hexagon (think of honey-bee nests or cellular…

Continue

Clustering – Algorithms for Partitioning and Assignments

Posted on October 31, 2018 at 7:06am 0 Comments

K-means algorithm is a popular and efficient approach for clustering and classification of data. My first introduction to K-means algorithm was when I was conducting research on image compression. In this applications, the purpose of clustering was to provide the ability to represent a group of objects or vectors by only one object/vector with an acceptable loss of information. More specifically, a clustering process in which the centroid of the cluster was optimum for the cluster and the…

Continue

Comment Wall

You need to be a member of Data Science Central to add comments!

Join Data Science Central

  • No comments yet!
 
 
 

Videos

  • Add Videos
  • View All

© 2019   Data Science Central ®   Powered by

Badges  |  Report an Issue  |  Privacy Policy  |  Terms of Service