Introduction
The automation of user interface (UI) design is fundamentally a problem of generating mappings between abstract specifications and concrete interface components. While systems like the MOBI-D environment attempt to formalize these mappings, they often encounter a significant hurdle: the "intuition" of human designers. Individual designers frequently follow stylistic preferences or "schools of design" that are not easily captured in static formalisms. When automated tools ignore these nuances, they forfeit the flexibility and creativity inherent in human design.
To address this, we propose an adaptive approach to automatic design. By integrating theory-refinement algorithms into the design process, automation can proceed without an exhaustive initial knowledge base, instead refining its logic through interaction. This allows the system to accommodate stylistic preferences and adapt to changing technological requirements.
The TIMM Module and Decision Trees
This research focuses on the TIMM module within the MOBI-D user-interface design environment. MOBI-D maintains explicit, formal representations of both abstract domain objects and concrete presentation elements. TIMM automates the mappings between these two sides using a decision tree.
While many theory-refinement systems utilize neural networks, decision trees offer a more transparent structure for UI design logic. When a designer disagrees with a choice made by TIMM, the system treats this as an error and initiates a refinement process to align its internal logic with the user's intent.
Adaptation via Theory Refinement
The system employs a greedy hill-climb search to identify a set of operations that minimizes errors across the user's entire interaction history. To maintain model stability and prevent over-correction, the algorithm follows a strict hierarchy of preferred operations based on their reversibility and structural impact:
- Leaf Output Change (Most Preferred): The system alters the output of the specific leaf that caused the error. For example, if the tree suggests a checkbox for a boolean variable but the user prefers radio buttons, the leaf's output is updated. This is the most preferred operation as it is easily reversible and does not alter the tree's structure.
- Boundary Condition Alteration: If a leaf change is insufficient, the system attempts to shift the thresholds of existing discriminants. For instance, if a list box is triggered at four items but the user prefers it only for five or more, the boundary is adjusted. This remains preferable to structural changes as it can be reversed by further boundary shifts.
- Adding a New Branch (Least Preferred): When an error stems from a relevant piece of information the tree currently ignores—such as the size of a parent window—the system adds a new discriminant. This is considered the least preferred operation because it is irreversible within the current framework and fundamentally changes the tree's structure.
Insights and Results
Preliminary testing indicates that these operations effectively bridge the "intuition gap." What is often perceived as "intuition" is frequently just a set of relevant variables that have not yet been formalized. By allowing the system to discover these variables (like window size or stylistic trends) over time, the knowledge base evolves alongside the designer's needs.
Key findings from initial evaluations include:
- Search Efficiency: Despite the use of a greedy hill-climb search, the system did not encounter local minima during testing, suggesting the search space is well-behaved for this domain.
- Versatility: The algorithm demonstrated success in acquiring new design knowledge, accommodating idiosyncratic user preferences, and updating automation logic to reflect changes in technology.
- Reversibility as a Constraint: Prioritizing reversible changes helps prevent the system from "overfitting" to temporary user whims, ensuring the core design theory remains robust.
Limitations and Future Directions
While the current system successfully adapts to user feedback, it lacks a mechanism for removing branches. This irreversibility means that over long periods of use, the decision tree could become unnecessarily bloated with discriminants that are no longer relevant. Future work should explore methods for pruning or retiring branches. Additionally, while preliminary results are promising, more extensive testing is required to determine how the search complexity scales with significantly larger interaction histories and more diverse design domains.
Summary updated