System for the analysis of web traces and clustering using the k-means algorithm

As an academic project I worked in the development of a system in the Java programming language with the Swing library for the user interface, which has as an entry a log document type “Combined log” where we take for each request the user id. We used an interval of 30 minutes to set a session. It means that several request with the same user in an interval between them lower than 30 minutes compose a session.

For the clustering of the different sessions I used the k-means algorithm with the numbers of clusters and the kind of distance as parameters. For the different kind of distances I coded the Euclidean distance, the cosine measure, and the Jaccard distance for the calculation at the moment to compare the sessions.

So that I clustered the sessions in different groups having common requests in such a way that we could to determinate statistics such as: the sites with the lowest and highest concurrence, predictions about links for the users, and relations between links.

Paris - France, December 2012

Approach to robotics using reinforcement learning

As an academic project I coded 3 reinforcement learning algorithms to learn how to a robot could to walk.

I used the V function with the Bellman equation, the Q function with a reformulation of the Bellman equation, and the Q learning algorithm with an approach E-greedy.

For the implementation of the algorithms I used a reward vector with a punishment when the robot goes down and goes back and with a reward when the robot goes forward. Likewise I used a transition vector with the different possible robot actions having false for the transitions which make the robot falls over.

Paris - France, November 2012

Multi-agents video-game using algorithms in reinforcement learning

As a personnel project I worked in the development of a video-game of about several agents who search in a laboratory for different components with the aim of create a nuclear bomb. The user player has to stop them to save the world.

For the development of the video-game I used the programming language Java with the swing library for the user interface and the JADE library for behavior programming in multi-agents.

For the artificial intelligence in agents I coded the MDP (Markov decision process) algorithm which allows to each agent how to find the shorter trail to the nearer bomb component, synchronizing and distributing the tasks for each agent using the Zeuthon algorithm.

For the MDP algorithm I used a reward’s vector with punishment for the position of the user player and rewards for the positions of the bomb components and an action's vector with the possible actions for the current agent.

Paris - France, October 2012

Multi-agent simulation platform for modeling agent’s behaviors in organizations

As an academic project I developed a multi-agent platform using netlogo script programming to simulate and modeling the effort and profit exerted by heterogeneous agents in an organization.

The platform consists in a user interface with the parameters as follows:

-              -10 sets of agents, each on with a different behavior, we can choose how many agents for each type of            agent:

o   null effort: this agent always exerts the same almost null effort

o   shrinking effort: this agent halves the effort provided by its last partner

o   replicator: this agent exerts the same effort its last partner exerted in the previous interaction

o   rational: this agent exerts the best reply for its last partner effort

o   profit comparator: this agent compares its profit to its last partner's one; it increases its effort if it gave a higher profit

o   high effort: this agent always exerts the same high effort

o   average rational: this agent exerts the best reply to the average effort of its partners

o   winner imitator: this agent starts with high effort but copies its partner's effort when this one proves to yield a higher profit

o   effort comparator: this agent compares its effort to its last partner's one; it increases its effort if it is inferior to its partner's one and vice versa

o   averager: it averages its effort with its last partner's effort

-              -A noise percentage at the moment of the communication between the agents.

The system reaches to find the Nash equilibrium in the society, in a way that each agent maximize his effort without minimize his profit.

Paris - France, September 2012

Grammatical tree for an interactive English e-learning

As a personal project using the techniques which I learned in the artificial intelligence classes of semantic web at the university I developed a dictionary tool which show in an interactive interface a grammatical tree. The input of the user interface was an English word and the result was a graph with the root associate to the word as a main node in the middle and several derivative nodes with the synonyms, phrases examples, and the different uses of the word, like a verb with the different tenses, like an adjective, and so on.

For the developing of the system I used an ontology web language (OWL) where I created a RDF (Resource Description Framework) graph using a tool called Protégé, for the search in the graph in the system I used a query language called SPARQL using a java library called JENA, and finally for the user interface I used two java libraries: Swing for the user controls and Prefuse for the interactive visualization of the graph (grammatical tree).

San Cristobal - Venezuela, July - August 2012

Evaluation of literary pastilles with the help plagiarism detection algorithms

This is was my final project for my master's first year in computer science - artificial intelligence degree. I developed a system, which evaluates a literary pastille against several books using the implementation and programming of plagiarism detection algorithms as Bag of words, Longest Common Substring, and Textual Detection Footprints.

The system is developed in python (Tkinter, Matplotlib, Os, Numpy), and consists in a system, which received as entry :
  - A collection of parameters.
  - One document to evaluate.
  - Several books in txt format for being evaluated with the document.

The system consists in a choice between the three differents algorithms. Each one of them algorithms give a solution with several statistics graphics regarding the property of plagiarism, and after, the system gave  in detail the more similar book with the paragraphs where it founds the plagiarism patron.

Paris - France, February – June 2012