static void Main(string[] args)
{
var total_runtime = Stopwatch.StartNew();
var reader = new LRNReader("data.lrn");
var songs = reader.ReadSongs();
int i = 0;
var stopwatch = Stopwatch.StartNew();
foreach (var s in songs)
{
i++;
if (i % 100 == 0)
{
stopwatch.Stop();
Console.WriteLine("Read 100 songs in "+stopwatch.Elapsed+" (total " + i + ").");
stopwatch.Restart();
}
}
total_runtime.Stop();
Console.WriteLine("Concluded in "+total_runtime.Elapsed);
Console.ReadKey();
}
static void Main(String[] args)
{
var reader = new LRNReader("data.lrn");
var songs = reader.ReadSongs().ToArray();
Console.WriteLine("LRN file read...");
var bestMatches = ESOMDataWrapper.BestMatches.FromFile("bigmap.bm");
Console.WriteLine("BM file read...");
var ESOM = ESOMDataWrapper.ESOM.Fromfile("bigmap.wts");
var UMat = ESOMDataWrapper.UMatrix.FromFile("bigmap.umx");
Console.WriteLine("UMatrix file read...");
var graph = new NeuronGraph(UMat.Heights, 0);
Console.WriteLine("Built read...");
int from = 23;
var fromCoord = bestMatches.Index2BestMatch[from];
int translatefrom = graph.translate(fromCoord);
// var shortestPath = new ShortestNeuronPath(graph, translatefrom);
var shortestPath = new ShortestNeuronPath(graph, translatefrom);
// Console.Write("Bellman Ford completed...");
var tocoord = bestMatches.Index2BestMatch[296];
var to = graph.translate(tocoord);
// Console.Write(shortestPath.HasPathTo(to));
var result = shortestPath.HasPathTo(to) ? shortestPath.pathTo(to) : null;
Song source = songs[from];
double accumulatedDistance = 0.0;
List<Song> resultSongs = new List<Song>();
foreach (var directedEdge in result)
{
var coord = graph.translate(directedEdge.@from());
// Console.Out.Write(directedEdge.@from());
if (bestMatches.BestMatch2Index.ContainsKey(coord))
{
//var resultint = bestMatches.BestMatch2Index[coord].First();
//Console.Out.WriteLine("Length on BM list:" + bestMatches.BestMatch2Index[coord].Count);
var next = KNNBestMatches.FindKBestMatches(songs, bestMatches.BestMatch2Index[coord], source, 1);
source = next.FirstOrDefault() ?? source;
resultSongs.Add(source);
if (next.Count >= 1)
{
foreach (var resultint in bestMatches.BestMatch2Index[coord])
{
Console.Out.WriteLine("Song Name: {0} ... Artist Name: {1}",
songs[resultint].TrackName, songs[resultint].ArtistName);
}
}
}
}
double min = Double.MaxValue;
double max = 0.0;
for (int i = 0; i < resultSongs.Count - 1; i++)
{
double dist = Utilities.EuclideanDistance.Distance(resultSongs[i], resultSongs[i + 1]);
if (dist > max) max = dist;
if (dist < min && dist != 0) min = dist;
accumulatedDistance += dist;
}
var avgdist = accumulatedDistance / resultSongs.Count;
Console.Out.WriteLine("Total euclidean distance: {0} and average distance: {1} ", accumulatedDistance, avgdist);
Console.Out.WriteLine("Max distance: {0}... Min distance: {1}", max, min);
}