Open Hub
Open Hub

 Settings |  Report Duplicate

0
I Use This!
Very Low Activity

Commits : Listings

Analyzed about 4 hours ago. based on code collected 1 day ago.
Nov 05, 2025 — Nov 05, 2026
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document - 53.11
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document - 53.11 and 172
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document - in 53.11
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document - corrected typo(s) in 53.11
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
.pyc file for WordNetPath.py
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
- New WordNetPath.py file has been added to compute the path in a WordNet graph between two words - WordNetSearchAndVisualizer.py text generation code has been updated for importing and invoking path_between() function in WordNetPath.py by which set of sentences are created from the RGO WordNet subgraph. This path is obtained from common hypernyms for two word vertices for each of the edges in RGO WordNet subgraph. RGO graph is a WordNet+ graph as it adds a new relation "is in definition of" to the existing WordNet that enhances WordNet relations. Each edge in RGO graph is made a hyperedge due to this hypernym path finding. - logs and screenshots have been added for above
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
- Updated SentimentAnalyzer.py and SocialNetworkAnalysis_Twitter.py scripts with core number and k-core DFS belief potential propagation similar to SocialNetworkAnalysis_WebSpider.py. - logs and screenshots for twitter followers graph and tweet RGO graph Sentiment Analysis have been added. - Example tweet is correctly automatically classified into "Education" class based on top core number of the vertices and top PageRank. Again this is an intriguing instance where Top core numbered vertices coincide with Top PageRank vertices which is probably self-evident from the fact that PageRank is a Markov Model Converging Random Walk and PageRank matrix multiplication is influenced by high weightage vertices (with lot of incoming links)
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
- Updated Spidered text for Sentiment Analysis - Changed the Sentiment Analysis scoring belief potential propagation algorithm: - Two ways of scoring have been added - one is based on DFS tree of k-core subgraph of the larger wordnet subgraph and the other is based on top core numbered vertices of the wordnet subgraph - Sentiment thus is computed only for the core of the graph which is more relevant to the crux or class of the document and less pertinent vertices are ignored. - the fraction score is multiplied by a heuristic factor to circumvent floating points
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
- Added more edges in definition graph by enumerating all the lemma names of a keyword in previous iteration. This makes the graph dense and probability of a node having more k-core number increases and classification is more accurate. - logs and screenshots for updated web spidered news texts of two topics "Theoretical Computer Science" and "Chennai" have been added
Srinivasan Kannan
More... almost 11 years ago
- Added more stop words in spidered text and commented text generation in SocialNetworkAnalysis_WebSpider.py - logs and screenshots for this has been added to testlogs/ - crawl urls in WebSpider.py has been updated
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 11 years ago
logs for updated spidered text
Srinivasan Kannan
More... almost 11 years ago