Matches in ScholarlyData for { ?s ?p ?o. }
- 571 isPartOf proceedings.
- 571 keyword "mobile".
- 571 keyword "p2p".
- 571 keyword "privacy".
- 571 keyword "social".
- 571 title "Musubi: Disintermediated Interactive Social Feeds for Mobile Devices".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent ben-dodson.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent tj-purtell.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ian-vo.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent monica-lam.
- item-4 previous item-3.
- 590 creator carlos-guestrin.
- 590 creator dafna-shahaf.
- 590 type InProceedings.
- 590 label "Trains of Thought: Generating Information Maps".
- 590 sameAs 590.
- 590 abstract "When information is abundant, it becomes more and more difficult to fit nuggets of knowledge into one large coherent picture. Complex stories spaghetti into branches, side stories, dead ends, and intertwining narratives. In order to explore these stories, one needs a map to guide them through the unfamiliar territory. We propose a new model for creating structured summaries of information, which we call metro maps. Our proposed algorithm generates a concise structured set of documents which maximizes coverage of salient pieces of information. Most importantly, metro maps explicitly show the relations between the retrieved pieces in a way which captures story development. In this work, we formalize the characteristics of a good map and formulate it as an optimization problem. We then provide efficient methods with theoretical guarantees for generating maps. Finally, we integrate user interaction into our framework, allowing users to alter the maps to better reflect their interests. Pilot user studies with our web application demonstrate that our method is able to produce metro maps which help users acquire knowledge quickly on a real-world dataset.".
- 590 hasAuthorList authorList.
- 590 isPartOf proceedings.
- 590 keyword "Information maps".
- 590 keyword "Story lines".
- 590 keyword "Summarization".
- 590 keyword "Visualization".
- 590 title "Trains of Thought: Generating Information Maps".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent dafna-shahaf.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent carlos-guestrin.
- item-2 previous item-1.
- 626 creator gengxin-miao.
- 626 creator james-r-moulic.
- 626 creator louise-moser.
- 626 creator shu-tao.
- 626 creator winnie-cheng.
- 626 creator xifeng-yan.
- 626 type InProceedings.
- 626 label "Understanding Task-driven Information Flow in Collaborative Networks".
- 626 sameAs 626.
- 626 abstract "Collaborative network is a special type of social network formed by members who collectively achieve specific goals, e.g., fixing software bugs, resolving customers' problems, etc. In such networks, information flows among members are driven by the tasks assigned to the network, and by the expertise of its members toward finishing these tasks. In this work, we analyze real-life collaborative networks to understand their common characteristics and how information is routed in these networks. Our study shows that the topology of collaborative networks not only exhibits scale-free properties in node degree distribution, but also has other organizational constraints. Furthermore, the number of steps in which information gets routed in these networks follow a power-law distribution too. Based on these observations, we develop a network model that can generate synthetic collaborative networks subject to certain structure constraints. We further design a routing model that emulates task-driven information routing conducted by human beings in a collaborative network. Together, these two models can be used to study the efficiency of information routing in different topological settings of a target collaborative network -- a problem that is important in practice yet difficult to solve without the method proposed in this work.".
- 626 hasAuthorList authorList.
- 626 isPartOf proceedings.
- 626 keyword "collaborative network".
- 626 keyword "information routing".
- 626 keyword "network model".
- 626 keyword "observations".
- 626 keyword "simulation".
- 626 title "Understanding Task-driven Information Flow in Collaborative Networks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasLastItem item-6.
- item-1 type ListItem.
- item-1 hasContent gengxin-miao.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent shu-tao.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent winnie-cheng.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent james-r-moulic.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent louise-moser.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent xifeng-yan.
- item-6 previous item-5.