Reference List Management via Automatic Deletion Candidate Suggestion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for managing reference lists in electronic commerce websites often result in the accumulation of unnecessary transaction objects, leading to list enlargement, as they either delete essential items or require significant time and effort to organize.
Innovation Solution
An information processing apparatus that suggests deletion candidates for unnecessary transaction objects by associating them with a target object based on retrieval conditions, registration time, browsing history, and attributes, allowing for targeted removal from the reference list.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the user manually searches and deletes unnecessary transaction objects from the reference list, then the reference list can be organized and prevented from enlarging, but it requires significant time and effort from the user
Solution Approach 1:
The system automatically identifies and presents deletion candidates for transaction objects by analyzing browsing history and access patterns, allowing the reference list to organize itself without requiring manual user intervention for each deletion decision
Solution Approach 2:
The system uses browsing history and access pattern data as feedback to automatically determine which transaction objects are candidates for deletion, creating a closed-loop system that continuously optimizes the reference list based on actual user behavior
2Productivity
If the system automatically deletes transaction objects that have not been accessed for a predetermined time, then the reference list can be kept organized, but essential transaction objects may be deleted that the user actually needs
Solution Approach 1:
The system analyzes actual browsing history and access patterns as feedback to determine deletion candidates, ensuring that transaction objects still implicitly needed by the user are not deleted even if not recently accessed
Solution Approach 2:
The system presents deletion candidates to the user for confirmation before actual deletion occurs, allowing the user to review and prevent deletion of essential transaction objects while still benefiting from automated candidate identification
3Ease of operation
If the user registers transaction objects in the reference list one after another, then the user can easily access information on transaction objects, but unnecessary transaction objects accumulate and the reference list enlarges
Solution Approach 1:
The system automatically identifies and presents deletion candidates for transaction objects by analyzing browsing history and access patterns, allowing the reference list to self-optimize without requiring manual user intervention
Solution Approach 2:
The system enables easy removal of unnecessary transaction objects from the reference list by presenting deletion candidates, allowing the user to discard unwanted items while preserving necessary ones, thus maintaining an optimized reference list size
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Enlargement of a reference list is prevented by supporting appropriate deletion of transaction objects, which are unnecessary to register in the reference list, fromthe reference list. An information processing apparatus includes: a selecting means that selects, as candidates for deletion from a reference list, a transaction object associated with a transaction object targeted for operation among transaction objects registered in the reference list, based on reference list information of a user, which is stored in a storing means that stores the reference list information indicating transaction objects registered in the reference list holding a reference to information associated with the transaction objects, when a predetermined operation relating to selection of the transaction object is performed by the user; and a controllingmeans that suggests the deletion candidates selected by the selecting means.