Hyperlink Ranking via Aggregated Bipartite Graphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional ranking systems for online sources and e-commerce vendors are subjective and prone to manipulation, failing to provide a reliable and trustworthy assessment of information and vendor reliability due to the influence of 'link farms' and fake reviews.
Innovation Solution
A system that constructs bipartite graphs weighted by different criteria to aggregate and rank hyperlinks on a GUI, using a weighted HITS algorithm to determine a seller trust rating based on past transactions, thereby reducing subjectivity and manipulation by considering cumulative transaction value, frequency, and duration.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional link analysis algorithms (HITS) are used to rank webpages, then the system can identify authoritative webpages through recursive link following, but the ranking can be manipulated by link farms generating fake hubs
Solution Approach 1:
The patent introduces an intermediary verification layer between the link analysis algorithm and the final ranking. Instead of directly trusting the HITS algorithm output, the system uses multiple independent data sources (social media mentions, news articles, expert reviews) as intermediaries to verify and validate the authority rankings, thereby preventing manipulation by link farms
Solution Approach 2:
The system implements feedback mechanisms where user interactions, corrections, and validations are continuously incorporated into the ranking algorithm. This dynamic feedback loop allows the system to adapt to and counteract manipulation attempts by adjusting rankings based on real-world verification rather than static link analysis
2Ease of operation
If existing rating systems use subjective buyer reviews to assess vendor reputation, then the system can provide vendor rankings, but the ratings are open to interpretation and manipulation through fake reviews
Solution Approach 1:
The patent segments the vendor assessment into multiple independent dimensions rather than relying on a single subjective rating. Each dimension (delivery reliability, product quality, customer service) is evaluated separately using different data sources and methodologies, making it difficult for manipulators to fake performance across all dimensions simultaneously
Solution Approach 2:
The system changes the parameters used for vendor assessment from subjective buyer opinions to objective transactional data (delivery times, product specifications, verified purchase records). This parameter transformation converts the rating system from interpretation-based to evidence-based, reducing susceptibility to manipulation
3Reliability
If multiple ranking criteria are aggregated to improve reliability, then the trustworthiness of the system increases, but the device complexity increases due to multiple graph constructions
Solution Approach 1:
The patent merges multiple independent bipartite graphs (each representing a different data source or criterion) into a single aggregated graph structure. This unified representation allows the system to leverage multiple criteria for improved reliability while managing complexity through a cohesive mathematical framework rather than separate independent systems
Data Source
AI summary
Methods and systems for arranging hyperlinks on a graphical user-interface (GUI) of a computerized system include receiving, via the GUI, a user selection to display a plurality of hyperlinks, the hyperlinks corresponding to one or more nodes of a first set. The methods and systems further include determining, by a processor, a rank of each hyperlink in the plurality of hyperlinks. Determining a rank includes constructing a first bipartite graph between the one or more nodes of the first set and one or more nodes of a second set, the first set and the second set being mutually exclusive, wherein edges of the first bipartite graph are weighted according to a first criterium and constructing a second bipartite graph between the one or more nodes of the first set and the one or more nodes of the second set, wherein edges of the second bipartite graph are weighted according to a second criterium, different from the first criterium. The first bipartite graph and the second bipartite graph are aggregated to form an aggregated bipartite graph. The one or more hyperlinks are ranked ordinally according to an aggregate weight of the corresponding node in the aggregate bipartite graph. The first-ranked hyperlink is automatically moved to a first position on the GUI and the second and subsequently ranked hyperlinks are automatically moved to second and subsequent positions, respectively, on the GUI.