Learn about the ugly duckling theorem in its relationship with algorithmic bias.

# Baeldung Author

## Gabriele De Luca

Gabriele specializes in artificial intelligence and innovation and on the impact of technology on society. He has authored several scientific papers in the sectors of machine learning, natural language processing, network theory, and multi-agent simulations. On Baeldung he contributes to the section on computer science, where he publishes articles on the theory behind machine learning and artificial intelligence.

## Here's what I've written (so far):

### Normalize Features of a Table

Filed under Artificial Intelligence

Learn how to normalize the features of a table or dataset.

### Haversine Formula

Filed under Math and Logic

Learn about the Haversine formula for calculating great circle distances in spherical surfaces.

### Algorithm for “Nice” Grid Line Intervals on a Graph

Filed under Algorithms, Latex, Series

Explore an algorithm for placing nice gridlines on a bar chart.

### The Difference Between Lower Bound and Tight Bound

Filed under Math and Logic

Explore the difference between Omega notation for lower bounds and the Theta notation for tight bounds.

### Roulette Selection in Genetic Algorithms

Filed under Algorithms

Study the roulette wheel selection method for genetic algorithms.

### Geofencing – Determining Whether a Point is Inside of a Polygon

Filed under Algorithms

Learn how to determine whether a point is inside a polygon or not.

### Choosing an Attractive Linear Scale for a Graph’s Y Axis

Filed under Algorithms, Latex, Series

Learn how to determine a nice scale for the Y axis in a chart.

### Converting a Uniform Distribution to a Normal Distribution

Filed under Artificial Intelligence

Explore how to generate a pseudorandom variable that’s distributed normally.

### Gradient Descent vs. Newton’s Gradient Descent

Filed under Artificial Intelligence

Compare gradient descent and Newton’s method for finding the minima in a cost function.