Decision-theoretic methods for identifying relevant substructures of a hierarchical file structure to enhance the efficiency of document access, browsing, and storage
First Claim
1. A computer implemented system for predicting a target file directory, comprising:
- a first component that infers and/or determines expected navigation costs for directory operations associated with potential target directories, the expected navigation cost is based on a probabilistic and/or utility analysis that includes a list scan penalty for reducing probabilities associated with scanning lists within a directory; and
a second component that outputs a subset of the potential target directories to a display, the subset is determined by selecting target directories, based in part on the expected navigation cost, in order to minimize a cost of traversing directories.
2 Assignments
0 Petitions
Accused Products
Abstract
A system and methodology is provided for improving directory operations within a system providing an electronic hierarchical directory of items. The system includes a component which analyzes probabilities and utilities associated with determining potential target directories for storing and accessing data, and a component for building a subset of the potential target directories that are predicted to be the target directory. The probabilities and/or utilities are functions of expected navigation costs associated with traversing from a displayed directory to at least one of the potential target directories. Methods in accordance with the present invention can be coupled with displays of substructures that format the substructures into a coherent hierarchical view.
-
Citations
27 Claims
-
1. A computer implemented system for predicting a target file directory, comprising:
-
a first component that infers and/or determines expected navigation costs for directory operations associated with potential target directories, the expected navigation cost is based on a probabilistic and/or utility analysis that includes a list scan penalty for reducing probabilities associated with scanning lists within a directory; and a second component that outputs a subset of the potential target directories to a display, the subset is determined by selecting target directories, based in part on the expected navigation cost, in order to minimize a cost of traversing directories. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 23, 24, 25)
-
-
11. A method effectuated at least in part by a machine for determining a potential target node for directory operations, comprising:
-
assigning probabilities and utilities to a plurality of potential target nodes, the utilities represent costs associated with navigating from a recommended node to an actual target node; determining a list scan penalty for reducing the probabilities associated with scanning lists within a directory; determining an expected utility from the probabilities and utilities associated with the plurality of target nodes; and displaying a candidate list of likely nodes to a user based upon the expected utility. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 26, 27)
-
-
22. A machine implemented system for determining a potential target node for directory operations, comprising:
-
means for assigning probabilities and utilities to a plurality of potential target nodes; means for determining a list scan penalty for reducing the probabilities associated with scanning lists within a directory; means for determining an expected utility from the probabilities and utilities associated with the plurality of target nodes; and means for displaying a candidate list of likely nodes to a user based upon the expected utility, the candidate list comprises a subset of the potential target nodes.
-
Specification