hpi-sam / BP2018HG1

Bachelor Project Documentation
MIT License
0 stars 0 forks source link

Implement a Graph representation of search queries #44

Open Askir opened 5 years ago

Askir commented 5 years ago

As a Developer I want to implement a search-query graph In order to understand how well the search works

All searches should be somehow logged into the graph database and ideally connected to the returned results. Then the user should have the opportunity to select if he found what he was looking for: How happy are you with the results?

very happy - somewhat happy - neither happy nor unhappy - slightly unhappy - very unhappy

If he selects one of the last 2 he should be offered to search again. Again we log the query + results in a graph (also connected to the previous search and mark the questions results). So that eventually we can check how many tries people need to find the picture they were looking for and can classify the problems on why they didn't find what they were looking for on the first try: example:

... graph

Acceptance Criteria

arne-z commented 5 years ago

Might be cool to add a card at the end of any search result saying something. like "Didn't find what you were looking for? Click here to refine the search." so when a user looks through the search results all the way he finds this message. This would stop us from annoying users with "How did you like the result" messages when they find what they were looking for.