Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent aditya-pal.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent vibhor-rastogi.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ashwin-machanavajjhala.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent philip-bohannon.
- item-4 previous item-3.
- 1153 creator david-crandall.
- 1153 creator gretchen-lebuhn.
- 1153 creator haipeng-zhang.
- 1153 creator mohammed-korayem.
- 1153 type InProceedings.
- 1153 label "Mining Photo-sharing Websites to Study Ecological Phenomena".
- 1153 sameAs 1153.
- 1153 abstract "The rapid rise in popularity of social sharing websites like Flickr and Twitter has created enormous collections of user-generated content online. Latent in these content collections are observations of the world: each photo is a visual snapshot of what the world looked like at a particular point in time and space, for example, while each tweet is a textual expression of the state of a person and their environment. Aggregating together these observations across millions of social sharing users could lead to new techniques for large-scale monitoring of the state of the world and how it is changing over time. In this paper we step towards that goal, showing that by analyzing the tags and image features of geo-tagged, time-stamped photos we can measure and quantify the occurrence of ecological phenomena including ground snow cover, snow fall and vegetation density. We compare several techniques for dealing with the large degree of noise in the dataset, and show how machine learning can be used to reduce errors caused by misleading tags and ambiguous visual content. We evaluate the accuracy of these techniques by comparing to ground truth data collected both by surface stations and by Earth-observing satellites. Besides the immediate application to ecology, our study gives insight into how to accurately crowd-source other types of information from large, noisy social sharing datasets.".
- 1153 hasAuthorList authorList.
- 1153 isPartOf proceedings.
- 1153 keyword "Data mining".
- 1153 keyword "ecology".
- 1153 keyword "photo collections".
- 1153 title "Mining Photo-sharing Websites to Study Ecological Phenomena".
- 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 haipeng-zhang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent mohammed-korayem.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent david-crandall.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent gretchen-lebuhn.
- item-4 previous item-3.
- 1168 creator ashish-goel.
- 1168 creator bahman-bahmani.
- 1168 type InProceedings.
- 1168 label "Partitioned Multi-Indexing: Algorithms, Analysis, and Applications to Social Search".
- 1168 sameAs 1168.
- 1168 abstract "In many social networking applications, specially with user generated content, it is desirable to give a higher ranking to content that is closer to the individual issuing the query. Queries occur at nodes in a network, documents are also created by nodes in the same network, and the goal is to find the document that matches the query and is closest in network distance to the node issuing the query. In this paper, we present the ``Partitioned Multi-Indexing'' scheme, which provides an approximate solution for this problem. Our scheme requires pre-processing time that is $\tilde{O}(m)$ where $m$ is the number of links in the network\footnote{The $\tilde{O}(m)$ notation hides factors that are poly-logarithmic in the $m$.}. After this pre-processing, our scheme allows for social index operations (i.e., social search queries, insertion of words into a document at any node, and deletion of words), all in time $\tilde{O}(1)$. Further, this scheme can be implemented to work on open source distributed streaming systems such as Yahoo! S4 or Twitter's Storm so that every social index operation takes $\tilde{O}(1)$ processing time and network queries in the worst case, and just two network queries in the common case where the reverse index corresponding to the query keyword is much smaller than the memory available at any distributed compute node. Our scheme builds upon an approximate distance oracle of Das Sarma et al. \cite{DasSarma10}. The worst-case approximation ratio of our scheme is $\tilde{O}(1)$ for undirected networks; our simulations on the social network Twitter as well as synthetic networks show that in practice, the approximation ratio is actually close to 1 for both directed and undirected networks. We believe that this work is the first demonstration of the feasibility of social search with real-time text updates at large scales.".
- 1168 hasAuthorList authorList.
- 1168 isPartOf proceedings.
- 1168 keyword "Distributed Streaming".
- 1168 keyword "Massive Scale".
- 1168 keyword "Real Time".
- 1168 keyword "Social Search".
- 1168 keyword "Strong theoretical efficiency and quality guarantees".
- 1168 title "Partitioned Multi-Indexing: Algorithms, Analysis, and Applications to Social Search".
- 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 bahman-bahmani.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent ashish-goel.
- item-2 previous item-1.
- 1174 creator chao-yang.
- 1174 creator guofei-gu.
- 1174 creator jialong-zhang.
- 1174 creator robert-harkreader.
- 1174 creator suengwon-shin.
- 1174 type InProceedings.
- 1174 label "Analyzing Spammers' Social Networks For Fun and Profit -- A Case Study of Cyber Criminal Ecosystem on Twitter".
- 1174 sameAs 1174.
- 1174 abstract "In this paper, we perform an empirical analysis of the cyber criminal ecosystem on Twitter. Essentially, through analyzing inner social relationships in the criminal account community, we find that criminal accounts intend to be socially connected, forming a small-world network, and also find that criminal hubs intend to follow criminal accounts rather than blindly following other accounts. Through analyzing outer social relationships between the criminal account community and criminal supporter community, we find three types of criminal supporters that have close friendships with criminal accounts. Through these analysis, we provide a novel and effective criminal account inference algorithm by exploiting the social relationship and semantic coordinations in the criminal account community.".
- 1174 hasAuthorList authorList.
- 1174 isPartOf proceedings.
- 1174 keyword "Cyber criminal".
- 1174 keyword "Ecosystem".
- 1174 keyword "Twitter".
- 1174 title "Analyzing Spammers' Social Networks For Fun and Profit -- A Case Study of Cyber Criminal Ecosystem on Twitter".
- 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 hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent chao-yang.