Différences

Ci-dessous, les différences entre deux révisions de la page.

--- projets:plim:20142015:gr17 [2014/11/23 22:52] – [MAIN INFORMATIONS about the Project] ouhichi
+++ projets:plim:20142015:gr17 [2014/11/23 22:55] (Version actuelle) – [MAIN INFORMATIONS about the Project] ouhichi
@@ Ligne 127: / Ligne 127: @@
 == III- Project Step by Step : ==
@@ Ligne 138: / Ligne 140: @@
-Once Data are collected it will be stored in a local data base which uses LINQ to SQL to allow an object-oriented approach in order to work with data and comprises an object model and a runtime.
+Once Data are collected it will be stored in a local data base.
 The local DB will be useful on one hand to apply various processing like classification and on the other hand to
 Keep a journalisation of the activities of the users and the possibility of displaying them at the needs.
@@ Ligne 151: / Ligne 153: @@
-The algorithm of the k-averages (or K-means ) is an algorithm of partitioning of data raising statistics and machine learning. This method divide observations K cluster in which every observation belongs to the partition with the closest average.
 In our application once profiles are classified we ally K-means algorithm to have a clear distribution in form of group of the places the most visited and seen frequently by the users.
+These cluster will be shown on the maps and marked with circles.