Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mike Develin

dblp:52/5267 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorArtificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Collaborative and social computing › social media
emotional sharing
0.212016
Once More with Feeling: Supportive Responses to Social Sharing on Facebook · CSCW 2016
Collaborative and social computing
social media
0.212016
Once More with Feeling: Supportive Responses to Social Sharing on Facebook · CSCW 2016
Collaborative and social computing
social support
0.112016
Once More with Feeling: Supportive Responses to Social Sharing on Facebook · CSCW 2016

Methods — techniques the papers use, named apart from their topics

statistical analysis · 0.2large-scale log analysis · 0.2
YearPublicationVenuePosition
2016 Once More with Feeling: Supportive Responses to Social Sharing on Facebook
abstract
Life is more than cat pictures. There are tough days, heartbreak, and hugs. Under what contexts do people share these feelings online, and how do their friends respond? Using millions of de-identified Facebook status updates with poster-annotated feelings (e.g., “feeling thankful” or “feeling worried”), we examine the magnitude and circumstances in which people share positive or negative feelings and characterize the nature of the responses they receive. We find that people share greater proportions of both positive and negative emotions when their friend networks are smaller and denser. Consistent with social sharing theory, hearing about a friend's troubles on Facebook causes friends to reply with more emotional and supportive comments. Friends' comments are also more numerous and longer. Posts with positive feelings, on the other hand, receive more likes, and their comments have more positive language. Feelings that relate to the poster's self worth, such as “feeling defeated,” “feeling unloved,” or “feeling accomplished” amplify these effects.
Moira Burke, Mike Develin
CSCW2
2014 People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query Logs
abstract
Popular online social networks (OSN) generate hundreds of terabytes of new data per day and connect millions of users. To help users cope with the immense scale and influx of new information, OSNs provide a search functionality. However, most of the search engines in OSNs today only support keyword queries and provide basic faceted search capabilities overlooking serendipitous network exploration and search for relationships between OSN entities. This results in siloed information and a limited search space. In 2013 Facebook introduced its innovative Graph Search product with the goal to take the OSN search experience to the next level and facilitate exploration of the Facebook Graph beyond the first degree. In this paper we explore people search on Facebook by analyzing an anonymized social graph, anonymized user profiles, and large scale anonymized query logs generated by users of Facebook Graph Search. We uncover numerous insights about people search across several demographics. We find that named entity and structured queries complement each other across one's duration on Facebook, that females search for people proportionately more than males, and that users submit more queries as they gain more friends. We introduce the concept of a lift predicate and highlight how a graph distance varies with the search goal. Based on these insights, we present a set of design implications to guide the research and development of the OSN search in the future.
Nikita Spirin, Junfeng He, Mike Develin, Karrie Karahalios, Maxime Boucher
CIKM3
2007 Fire containment in grids of dimension three and higher
Mike Develin, Stephen G. Hartke
Discret. Appl. Math.1
2006 Tropical Secant Varieties of Linear Spaces
Mike Develin
Discret. Comput. Geom.1
2004 A Complexity Bound on Faces of the Hull Complex
Mike Develin
Discret. Comput. Geom.1
2003 A General Notion of Visibility Graphs
Mike Develin, Stephen G. Hartke, David Petrie Moulton
Discret. Comput. Geom.1