text:
USER connection is useful information for many personalised. Connection Discovery using Big Data of User Shared Images in Social Media
- Gabriella Anderson
- 1 years ago
- Views:
1 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Connection Discovery using Big Data of User Shared Images in Social Media Ming Cheung, Student Member, IEEE,, James She, Member, IEEE, and Zhanming Jie Abstract Billions of user shared images are generated by individuals in many social networks today, and this particular form of user data is widely accessible to others due to the nature of online social sharing. When user social graphs are only accessible to exclusive parties, these user shared images are proved to be an easier and effective alternative to discover user connections. This work investigated over 360,000 user shared images from two social networks, Skyrock and 163 Weibo, in which 3 million follower/followee relationships are involved. It is observed that the shared images from users with a follower/followee relationship show relatively higher similarities. A multimedia big data system that utilizes this observed phenomenon is proposed as an alternative to user generated tags and social graphs for follower/followee recommendation and gender identification. To the best of our knowledge, this is the first attempt in this field to prove and formulate such a phenomenon for mass user shared images along with more practical prediction methods. These findings are useful for information or services recommendations in any social network with intensive image sharing, as well as for other interesting personalization applications, particularly when there is no access to those exclusive user social graphs. Index Terms big data, user shared images, connection, discovery, recommendation, social network analysis I. INTRODUCTION USER connection is useful information for many personalised services or applications in online social networks. Such connections can be any type of online social relationship formed from some interactions between users in a social network, such as online friendship, a follower/followee relationship or a membership in the same community. Companies like Twitter and Pinterest, already have explicit information about user online friendships (i.e., social graphs) to improve their service relevance to users. Trending mobile social applications, such as Instagram (owned by Facebook from the US) and WeChat (owned by Tencent from China), keep the information of social graphs (SGs) only available to their related business services. Some users also hide or limit the information of their connections from the public in social media platforms due to privacy concerns. Accessing these SGs is getting more difficult and costly in today s online social networks, and novel applications using SGs become almost impossible to be offered independently by researchers, merchants, thirdparty practitioners and individuals. However, billions of user shared images are generated by individuals in many social networks daily, and this particular form of user data is indeed very accessible to others due to the nature of online image sharing. Hence, a common but unreliable alternative is using user annotated tags (or user tagging) associated with each shared image to discover user connections when the SG is Fig. 1: Examples of the user shared image and their features not accessible. In this work, using user shared images directly to discover the user connections in follower/followee relationships through some signal processing technique (e.g., bag-offeatures) is proved to be effective. Users with connections of follower/followee relationships are found to give relatively higher similarities of the visual features in their shared images. An extreme example of user generated images on Instagram is shown in Fig. 1: Both users A and B share images about cars and user C shared an image about a flower. The follower/followee relationship between users A and B can be possibly detected from the higher similarity of visual features in their shared images. When more shared images from each of users A, B and C are accessible for evaluation, the actual follower/followee relationships should become reliably and accurately detectable though becoming challenging to process when the number of shared images and user connections grows bigger and faster every day in social network. With the above motivations and challenges, this work has investigated over 360,000 user shared images and 3 million follower/followee relationships from 2 social networks - Skyrock from Europe and 163 Weibo from China. An interesting phenomenon of user shared images is observed from our intensive measurements, and this is formulated with a proposed method for a system to discover and recommend user connections in follower/followee relationships using user shared images directly. In summary, the contributions of this paper includes the following: 1) intensive measurements and characterizations of user shared images from two social networks, proved and formulated the phenomenon that two users with a higher similarity of their shared images are likely
2 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 2: Examples of connection discovery with different approaches, (a) ground truth, (b) SG-based, (c) image-based. to have a connection in a follower/followee relationship; 2) methods using bag-of-features tagging (BoFT) are proposed as a recommendation system to discover user connections and recommend follower/followee relationships by their shared images; 3) extensive verifications of the proposed formulation, methods and system are provided with the datasets from two social networks (one from Europe, and one from China) and two practical use cases to prove the effectiveness of using user shared images through bag-of-features tagging as a better alternative to using user annotated tags for recommending follower/followee relationship and gender prediction. This paper is organized as follows: section II presents the related works. Section III introduces the proposed method, BoFT, for connection discovery, while section IV shows the measurements of user shared images on the datasets. Section V proposes and formulates the follower/followee recommendation system, followed by the experimental results in section VI. Section VII concludes the paper and the future works. II. RELATED WORKS User behaviors in online social networks have been recently studied through the use of SGs in [1][2][3][4][5][6][7][8][9][10], and it was concluded that relationships (such as follower/followee and online friendships) in an SG are not formed randomly, but follow the power law distribution [11]. User connection can be therefore discovered and the connection strength can be obtained. Two users with a higher connection strength (more common related users) are more likely to be related, and the relationships are therefore predicted by their mutuality [12][13][14][15] from the strength of the discovered connections. An example is shown in Fig. 2 (b), where connection discovery is made via existing relationships, such as follower/followee, that users share in common. Users A, B and C share common related users, and connections among them can be obtained, while user D is alone. Without access to SGs, follower/followee recommendation is also possible with the connection discovered by user common interests inferred from user input [15][16][17] or user generated content [18][19] and other personal information [1][3][20][21][22]. Analyzing shared images can help to understand users, and hence discover the connections among them [23][24]. Another common method to discover user connections is to analyze user annotated tags on shared images [23][24][25][26], in which a tag in the form of textual wording is provided by a user as meta-data to describe the shared image. These tags can represent users, and connections can be therefore discovered by calculating the similarity of the user annotated tags. However, user generated tags are unreliable [10][23][27][28] due to the use of different and inconsistent language, different levels of detail and even inaccurate or missing words, which results in noisy or low performing connection discovery. Collaborative filtering (CF) techniques [29][30][31] are used to improve the tag accuracy for better connection discovery. However, only some popular images are annotated by many users, while the rest are either not correctly annotated or missing annotation, which leads to a poor connection discovery performance [23]. An emerging image-based approach [28][32] applies computer vision techniques to produce non-user generated labels that reflect the context of the images, regardless of their popularity. Fig. 2 (c) is an example of how connections are discovered by user generated images. Users A, B and C generate car images, and their connections can be discovered by the similarity among their images. As there is no model of the characteristics of user shared images and how BoFT similarity is distributed in [23], this paper has extended [23] on connection discovery using BoFT in the following way: 1) scraped two new datasets, Skyrock and 163 Weibo, for 360,000 user shared images and 3 million connections; 2) measured and modeled characteristic of user shared images and BoFT similarity distribution to explain how they are related to the connection discovery and follower/followee relationships; 3) formulated follower/followee recommendation based on the measurements and models, and verified that connection discovery is useful for recommendation and gender identification, even without using SGs and user annotated tags. III. BOF TAGGING AND SIMILARITY This section introduces the proposed method, BoFT, that labels images with non-user generated labels, BoFT labels, and how
3 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 3: BoFT: (a) annotation with BoFT labels, (b) user similarity calculation based on BoFT labels. BoFT similarity, the pairwise similarity among users based on BoFT labels, is calculated. A. BoF-Based Tagging Images are analyzed using BoFT, which annotates each image with a BoFT label. BoF is a popular computer vision approach for analyzing images [33]. Fig. 3 shows the key steps involved: Fig. 3 (a) is the steps for BoF and Fig. 3 (b) is the method for connection discovery based on user shared images. The different steps of BoFT are introduced in this section below. 1) Feature Extraction: Feature extraction is a process to obtain the unique local features in step 1 of Fig. 3 (a). These unique features can be detected by feature detection, such as the Harris Affine detector, Maximally Stable Extremal Regions detector [33] and KadirBrady saliency detector [34]. The extracted features are relatively consistent across images taken under different viewing angles and lighting conditions. In this work, the images representation is independent of the size and orientation by scale-invariant feature transform (SIFT) [35]. 2) Codebook Generation: Codebook generation in step 2 of Fig. 3 (a) is a clustering process to obtain a set of visual words, a representative and distinct set of unique visual features. This step starts with clustering extracted visual features into groups by clustering techniques, such as k-means clustering, based on their visual similarity, and the mean vectors of each group are defined as a visual word. Other possible techniques are the Canopy clustering algorithm [36] and LindeBuzoGray algorithm [37]. A k-means clustering is used in our work. 3) Feature Coding and Pooling: Feature coding represents each visual feature by the closest visual word. Each image is represented by a feature vector in the feature pooling, as shown in step 3 of Fig. 3 (a). One of the most common approaches is counting the number of occurrences of each unique visual word on an image as the feature vector. 4) Clustering and BoFT Labeling: Clustering groups images that are visually similar through the similarity in their feature vectors, whihc is shown in step 4 of Fig. 3 (a). For example, when two images contain cars in the countryside, the feature vectors of the two images are similar in terms of the number of occurrences of each unique visual word. As a result, the two images will be assigned the same BoFT label to indicate that they are visually similar. BoFT applies one of the most popular clustering algorithms, k-means, which
4 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 5: Distribution of the number of shared images a user has: (a) Skyrock, (b) 163 Weibo. L i = {l 1,...l k,...l K } (1) Fig. 4: User interface of: (a) Skyrock, (b) 163 Weibo. will first randomly generates k cluster centroids. It then iteratively assigns points to their nearest centroids, followed by a recomputing of the centroids until it converges. However, k-means does have its drawbacks in that the points lying far from any of the centers can significantly distort the position of the centroids and the number of centers must be known in advance. More discussion of this can be found in Section VI. The next step, BoFT labeling, assigns each cluster a BoFT label so that those images with the same BoFT label are visually similar, and this is shown in step 5 of Fig. 3 (a). The set of BoFT labels of user shared images of user i, L i, is obtained. L i is a vector, with each element being the set of occurrences of a BoFT label in the shared images of user i. The step is an unsupervised operation that analyzes user shared images without any manual input and process. B. Connection Discovery with BoFT labels This section introduces how connection can be discovered through BoFT labels. 1) BoFT Labels and User Profile: A user profile, which reflects the content of a user s shared images, is the key in connection discovery. The proposed method uses the number of occurrences of the BoFT labels in step 5 of Fig. 3 (a) of the shared images of a user as his/her user profile, as in step 6 of Fig. 3 (b). A user i is represented by his/her user profile, L i, and the distribution of the BoFT labels that the user has is defined as: where l k is the number of occurrences of the k-th label among the shared images of user i, and K is the total number of labels which is set to 500. The best value of K is subject to applications, and more discussion can be found in Section VI. 2) User Profile and User BoFT Similarity: When the user profile of each user is established, the next step is the connection discovery based on the BoFT similarity, S i,j, of users i and j, in which users who share highly similar images will have a high BoFT similarity. This requires a pairwise similarity comparison among user profiles based on the number of occurrences of BoFT labels, and this is calculated using the following formula: S i,j = S(L i, L j ) = L i L j L i L j where L i and L j are the set of BoFT labels of the shared image in the user profiles of users i and j, respectively. IV. MEASUREMENTS ON USER SHARED IMAGES This section first describes the dataset, followed by the characteristics of the user shared images and follower/followee relationships. The third part of this section analyzes the BoFT similarity distribution by BoFT [23]. A. The datasets Skyrock is a Western social networking site that allow users to create blogs, follow other users and exchange messages. Most of the users of Skyrock are from European countries like France, England, German, Holland, etc. 163 Weibo was a microblogging social network application from China with a similar mechanism to Twitter. As the user bases of the two social networks are different, it is interesting to observe whether the user behaviors in these social networks are similar. Fig. 4 shows the user interfaces of the two social networks, Skyrock and 163 Weibo. Skyrock, as shown in Fig 4 (a), users can share blogs with text, images and even video. On 163 Weibo, users share text and image content, as shown in Fig 4 (b). Similar to any social network, users of these networks can follow others (2)
5 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 6: Distribution of the number of follower/followee relationships a user has: (a) Skyrock, (b) 163 Weibo. Fig. 7: The set of all pairs: the solid line ellipses formed are user pairs with a given S i,j, with the white area is the non-related pairs and the coloured part the related pairs. The size of the ellipses represents the number of user pairs. to receive notifications of newly shared content from those they follow. The experiments involve 176,547 images uploaded by 722 users on Skyrock, and 187,491 images uploaded by 493 users on 163 Weibo, which were collected by official APIs in mid-2014, before 163 Weibo was shut down at the end of All the users were selected randomly from a large set of users collected from follower/followee relationships, in which there are about 80,000 and 100,000 users collected for the selection on Skyrock and 163 Weibo, respectively. The datasets comprise more than 3 million follower/followee relationships, not only including those among the 722 users on Skyrock and 493 users on 163 Weibo, but also all the followers/followees those users have. Among the randomly selected users, the network densities are 1.41% and 0.71% on Skyrock and 163 Weibo, respectively. They are not likely to know others. B. Characteristics of User Shared Images This section describes the characteristics of the user shared images and the follower/followee relationships. Fig. 5 (a) and Fig. 5 (b) show the distribution of the number of user shared images a user has, and the frequency of this number, on Skyrock and 163 Weibo, respectively. It is observed that a few users share a large number of images, while most of the users share a few images only, and the same trend can be observed on both social networks. Fig. 6 (a) and Fig. 6 (b) show the distribution of the number of follower/followee relationships a user has, and the frequency of this number on Skyrock and 163 Weibo, respectively. The same trend that a few users have a large number of follower/followee relationships, while most of the users have a few follower/followee relationships only can also be observed. The same observation can be found in both social networks. It is obvious that the distribution of the number of shared images and follower/followee relationships on both social networks follows the power law distribution, as do most social networks. It is concluded the selected users are a good representation of the users in the two social networks. C. BoFT Similarity Distribution In this paper, there are two types of user pairs: related pairs, which are the pairs of users that are follower/followee, and non-related pairs, which are the pairs in which a follower/followee relationship does not exist between the two users. Related pairs and non-related pairs can be considered as two classes, and the class of each pair, C, can be defined as { 1 if two users are a related pair C = (3) 0 if otherwise, where C = 1 is the class in which the pair is a related pair, and C = 0 is the class in which the pair is a non-related pairs. Fig. 7 illustrates the idea. The ellipse in the broken line is the
6 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 9: Distribution of BoFT similarity among pairs of (a) follower/followee relationships on Skyrock, (b) follower/followee relationships on 163 Weibo, (c) all users on Skyrock, (d) all users on 163 Weibo. Fig. 8: Mean BoFT similarity: related, non-related and all pairs. set of all pairs, with total N (p) pairs, which contains related and non-related pairs with different similarity values. The solid line ellipses are those with different ranges of S i,j. The areas in white of the colored ellipses are the sets of non-related pairs with a given range of S i,j, with n(s i,j, C = 0) pairs. n(s i,j, C) is a function of S i,j and C that gives the number of non-related pairs when C = 0, while giving the number of related pairs when C = 1. The coloured areas are the sets of related pairs with a given range of S i,j, with n(s i,j, C = 1) pairs. Fig. 8 shows the average BoFT similarity, S i,j, for related pairs, non-related pairs and all pairs. It is observed that both social networks have a similar trend: related pairs have a higher S i,j, in which related pairs are 136% and 53.8% higher S i,j than non-related pairs on 163 Weibo and Skyrock, respectively. Since the number of all pairs, N (p), is much greater than the number of related pairs, N (p) C=1, N (p) is close to the number of non-related pairs, N (p), and gives a similar average S i,j for non-related and all pairs. It is interesting to investigate the distribution of S i,j of users, how it affects the mean value of S i,j and how it can be modeled. Fig. 9 (a) and (b) show the distribution of the number of related pairs, given a S i,j, n(s i,j, C = 1), of Skyrock and 163 Weibo, respectively. Fig. 9 (c) and (d) show the distribution of the number of all pairs, given a S i,j, n(s i,j ), of Skyrock and 163 Weibo, respectively. It is observed that there are more related pairs with small BoFT similarities, while only a small number of them have a high S i,j. The same observation can be found in the distribution of S i,j of all pairs, and can be modeled by exponential distributions: f(s i,j ) = γe λsi,j, (4) where E[f(S i,j )] is equal to γ/λ 2. γ and λ are real numbers, and E[f(S i,j )] is the mean of f(s i,j ). The probability that S i,j occurs in all pairs, P (S i,j ), can be calculated as: b a P (S i,j ) = n(s i,j)ds (5) N (p) Similarly, the probability that S i,j occurs in related pairs, P (S i,j C = 1), can be calculated as: b a n(s i,j, C = 1)ds P (S i,j C = 1) = N (p) C=1 where a equals BS i,j /B and b equals BS i,j /B. B is the bin size, and B = 10 is used in this work. For example, P (0.15) is equal to n(s i,j)ds/n (p). Fig. 10 shows P (S i,j ) and P (S i,j C = 1) of the best fit curves and the approximation of the two social networks. It is observed that the best fit curve goes well with the values. In the two social networks, related pairs have smaller γ and λ than all pairs, which implies that a higher S i,j means a higher probability (6)
7 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 10: S i,j against the probability of S i,j, by the best fit curve and the measurement: (a) related pairs on Skyrock, (b) related pairs on 163 Weibo,(c) all pairs on Skyrock, (d) all pairs on 163 Weibo. they are a related pair. This idea can be illustrated by the area of the colored ellipses in Fig. 7: although the area (number of pairs) is smaller when S i,j is higher, a larger area of the coloured part (a higher portion of related pairs) can be observed. The same observation can be obtained from both social networks. V. FOLLOWER/FOLLOWEE RECOMMENDATION USING DISCOVERED CONNECTIONS This section introduces the system flow and formulation of how follower/followee recommendation can be made with discovered connections. This is a 3-stage (stages A to C) systems as shown in Fig. 11. The first part is image collection, followed by connection discovery using BoFT. The third part focuses on how to recommend follower/followees based on the discovered connections and the BoFT similarity distribution. The stages are introduced one by one in this section. A. Image Collection The proposed system carries out data collection as shown in step A of Fig. 11, which shows the process to collect user generated images from social media applications, such as Skyrock and 163 Weibo. The images can be provided by the operators of the social media and mobile applications or collected through the API of the social networks. The user generated images can be shared in various forms, such as posted images on social media or images shared through instant messaging applications. On social networks such as Skyrock and 163 Weibo, user generated images are those images shared by users. This process is ongoing, which means that user shared images are collected continuously. Fig. 11: System flow of the proposed system (a) image collection from social media; (b) connection discovery by collected images; (c) recommendation by discovered connections. B. Connection Discovery using BoFT The objective of the image understanding is to annotate user generated images with non-user annotated labels, as shown in step B of Fig. 11. The proposed system applies a computer vision approach to give a label to user generated images, which is not affected by the language, culture or other characteristics of the user who shares the image, but is based on the image s visual appearance only. The accuracy of the user generated tags is unreliable, sometimes even unavailable, and the per-
8 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY formance of connection discovery is affected. The proposed system applies BoFT to annotate user generated images with non-user annotated labels, called BoFT labels. The set of user shared images of user i is processed by the proposed method, and a set of BoFT labels, L i, is generated to represent user i. As discussed, millions of images are generated every day, so a system that can process big data with scalable storage design is needed for collecting and processing these user shared images, such as a cloud-assisted system to handle profile learning and similarity calculation [38] for a scalable system. The feature vectors are first split into multiple blocks in the Hadoop Distributed File System (HDFS) and distributed to virtual machines (VMs) for the k-means clustering process. Each VM is in charge of computing the distribution of different labels for several users, and the BoFT similarity is also calculated in a distributed way. C. Follower/followee Recommendation Follower/followee recommendation is one of the most popular applications on social media.the probability that two users are a related pair, or C = 1, given the BoFT similarity of user i and j, P (C = 1 S i,j ) can be calculated by Eq. 2 based on L i and L j. Follower/followee recommendation should be made based on P (C = 1 S i,j ), from the highest to the lowest. This section starts with discussions on how P (C = 1 S i,j ), can be formulated and calculated by the proposed system based on the measurements followed by how recommendations can be made from the measurement. By Bayes theorem, P (C = 1 S i,j ) can be written as: P (C = 1 S i,j ) = P (S i,j C = 1)P (C = 1) P (S i,j ) P (S i,j ) is the probability that S i,j occurs, while P (S i,j C = 1) is the probability that S i,j occurs given that two users are a related pair. P (C = 1) is the probability that users i and j are a related pair. By Eq. 4, P (S i,j ) can be calculated as: (7) P (S i,j ) = γ a e λasi,j (8) Similarly, P (S i,j C = 1) can be calculated as: P (S i,j C = 1) = γ f e λ f S i,j (9) and P (C = 1) can be obtained from: P (C = 1) = N (p) C=1 N (p) (10) where N (p) is the total number of possible user pairs and N (p) C=1 is the number of related pairs. N (p) can be calculated as: N (p) = N (u) (N (u) 1) (11) 2 where N (u) is the number of users. By putting Eq. 5, Eq. 9, Eq. 10 and Eq.11 into Eq. 7: P (C = 1 S i,j ) = γ f e λ f S i,j γ a e λasi,j N (p) C=1 N (p) = γ f 2N (p) C=1 γ a N (u) (N (u) 1) e(λa λ f )S i,j (12) and Eq. 12 can be written as: P (C = 1 S i,j ) = γ t e λtsi,j (13) where γ t is equal to (γ f /γ a )(2N (p) C=1 /N (u) (N (u) 1)) and λ t is equal to λ a λ f. Symbols γ t and λ t are constants, α f, α a, N (u) and N (p) C=1 are non-zero positive numbers, and γ t 0 is expected. The sign of λ t changes the distribution of P (C = 1 S i,j ). As a positive number will make P (C = 1 S i,j ) become a strictly increasing function, a higher BoFT similarity between a user pair implies a higher probability that the two users are a related pair. Based on the observation in Fig. 10, λ t = 8.09 and λ t = 2.36 are obtained on Skyrock and 163 Weibo, respectively. It can be concluded that a higher BoFT similarity, S i,j implies a higher P (C = 1 S i,j ), the probability that the two users, i and j, are a related pair. With the measurement, follower/followee recommendation can be conducted based on the discovered connections. In follower/followee recommendation, a list of J users, U i,j, is recommended to a user, i, given the BoFT similarities of all users and the list of users that are most likely to be related pairs with user i. The problem can be formulated as the following: U i,j = arg max U i,j P (U i,j S i,1,..., S i,n (u)) (14) where P (U i,j S i,1,..., S i,n (u)) is the probability that all users in U i,j are related pairs with user i, given the S i,j between user i and other users. Using Naive Bayes, Eq. 14 becomes: U i,j = arg max U i,j J P (C = 1 S i,j ), where j U i,j (15) j=1 Based on Eq. 12, P (C = 1 S i,j ) is a strictly increasing function with respect to S i,j, and to find Ui,J is equivalent to finding the list of J users that have the highest BoFT similarity to user i. Eq. 14 can be rewritten as: U i,j = arg max U i,j J S i,j, where j U i,j (16) j=1 The list of recommended users are those with the higher BoFT similarity to user i, and a recommendation system is built accordingly. The information can be sent to the social media and mobile applications when a list of follower/followee recommendations is needed for a given user. VI. EXPERIMENTAL RESULTS This section introduces how the experiment is conducted, followed by the experimental results with two showcases. A discussion of the results concludes this section. A. Setup Based on the observation that user pairs with a higher BoFT similarity are more likely to be follower/followee, discovered connections can be evaluated as a follower/followee recommendation system using S i,j. Fig. 12 shows the experiment setup for the evaluation with user shared images from Skyrock and 163 Weibo. As in step 1 of Fig. 12 (a), the user shared images are analyzed using BoFT, as in Fig. 3 (a), and users are
9 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 13: Performance of follower/followee recommendations with connection discovery, in precision p (upper part) and recall r (lower part): (a) and (b) are the p from 5 to 10, for Skyrock and 163 Weibo, respectively, (c) and (d) shows the r from 5 to 10 for Skyrock and 163 Weibo, respectively. Fig. 12: Two steps in experimental setup: 1) ranking by S i,j of discovered connections, 2) evaluation by ground truth. represented by user profiles and the distribution of BoFT labels that the user has, as in Fig. 3 (b). Connections are discovered by computing the pairwise S i,j by Eq. 2 with the user profiles. The list of users to be recommended to user i, are ranked by S i,j in the discovered connections. By Eq. 16, the set of J users are most likely to be follower/followees of user i if they are users with the highest similarities. As a result, the set of users with the highest similarities are recommended to user i, and the results are evaluated by two common metrics of prediction performance, recall rate r and precision rate p, for users with the highest similarities, as in step 2 of Fig. 12. The precision rate, p, measures the percentage of discovered follower/followee relationships that exist in the ground truth, while r is the percentage of existing follower/followee relationships in the ground truth that are recommended. A better discovery and recommendation method should give a higher value of p and r. In order to evaluate the effectiveness of the proposed system, three connection discovery methods for follower/followee recommendation are implemented for comparison. The first method is FoF, which is an achievable upper bound when difficult and limited access SGs are available. The recommendation is from the similarity of the SGs. The second method uses user annotated tags (UserT), and the recommendation is based on the connection discovered based on the similarity among the user annotated tags on shared images between two users. Each user is represented by a user profile of the occurrence of each user annotated tag (152,938 unique tags) used in the dataset. The connection strength in both methods is calculated by cosine similarity, and the same methods are used as in Fig. 12. The third method is a random method (Rand), in which follower/followee relationships are recommended randomly. This serves as a baseline, or the lower bound for the evaluation. The ground truth, the follower/followee relationship, is hidden in that it is not used as an input to the calculation. B. Results The number of recommendations is set to be 5 to 10, to simulate a normal recommendation system; however, the same trend can be found even when a smaller or a bigger number of recommendations is used. As the selected users are scraped randomly, the network densities are low, with 1.41% and
10 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 14: Follower/followee recommendation results in Flickr with the proposed system and user annotated tags: (a) p, (b) r. 0.71% on Skyrock and 163 Weibo, respectively. The low network densities make the recommendation challenging, with Rand only able to achieve 1.41% and 0.71%. Fig. 13 (a) and (b) show the p of different methods against the number of recommendations, on Skyrock and 163 Weibo, respectively. It is observed that the proposed method is at least 4 times better than Rand, and achieves 25% of the performance of FoF, the achievable bound of the discovery. Fig. 13 (c) and (d) show the r of different methods against the number of recommendations from 5 to 10 on Skyrock and 163 Weibo, respectively. The same observation is found for r. BoFT achieves 20% and 41% of the r value of FoF for Skyrock and 163 Weibo, respectively. The results show that the proposed approach can indeed recommend follower/followees using discovered connections. Table I shows the runtime of the proposed system. The user shared images are processed by two different calculations. The first one is a Matlab program running on a machine with 8Gb of memory and an i CPU, and running feature extraction, codebook generation and feature coding and pooling The runtime is shown in Table I(a). The second one is a cloud-assist calculation with 8 virtual machines, using m3.xlarge on Amazon EC2. It runs clustering, profile learning and similarity calculation, and the runtime is shown in Table I(b). It is observed that feature extraction and clustering spend most of the runtime, of which it takes 583s and 265s for each user on 163 Weibo and Skyrock, respectively. A longer runtime is expected when more users and user shared images are involved, and a big data system is needed to handle the data. TABLE I: Runtime for BoFT (a) Process Time (in sec) 163 Weibo Skyrock Feature Extraction 215, ,051 Codebook Generation 43,772 42,351 Feature Coding & Pooling (b) Clustering 71,723 61,586 Profile Learning 1, Similarity Calculation 788 1,089 Total 333, ,329 C. Showcase 1: User Annotated Tags on Flickr Tagging is a popular feature on many social networks today, such as Flickr. Flickr is an image oriented social network, that focuses on the sharing of images, and all content shared involves at least one image. Follower/followee relationships can be predicted with the discovered connections from the similarity of the user annotated tags on the shared images between two users. It is interesting to compare the effectiveness of the proposed method on an image oriented social network, using user annotated tags to calculate the user similarity, UserT. A comparison between UserT and the proposed method on Flickr is evaluated with over 201,006 user shared images from 562 users with 902 relationships, as used in [23], and is shown in Fig. 14. Fig. 14 (a) shows p and Fig. 14 (b) shows r for the top 5 to 10 highest similarity users. It is proved that the proposed BoFT method performs better than UserT, meaning it could be a better alternative for today s social networks when an SG is not accessible. The results proved that the proposed method is 65% better than UserT in terms of both p and r on Flickr. D. Showcase 2: Discovering Gender on Flickr Profiles on social media are also important for applications but are not always available. Among the information in profiles, gender is interesting, as it is useful for recommendation. Another showcase using the same Flickr dataset is conducted to show how gender can be identified with discovered connections. 445 out of the 562 users provide their gender, and of these there are 79 females and 366 males. In each trial, 50 females and 50 males are selected randomly and S i,j is calculated. The experiment uses a 5-NN approach, in which the gender of the top 5 users, with the highest S i,j with user i, is predicted as the gender of user i, and this is verified by the ground truth trials were conducted and the averaged result is shown in Fig. 15. It is observed that gender identification is possible with the discovered connections, being 22% better than that random guessing. This showcase proved that the proposed method can be an alternative to SGs. E. Discussions This paper has successfully proved and characterized the phenomenon that related pairs share similar images by mass
11 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY Fig. 15: Gender discovery results: (a) measurement on S i,j, (b) discovery using 5-NN with S i,j. user shared images from real-world social networks, and then formulated and developed the results into practical methods to discover user connections. There are other methods, such as that in [13], which proved that using a completed SG performs better than FoF. However, it would be more useful to compare the proposed method with other inputs under the same experimental procedures to prove the possibility of using user shared images for recommendation. Further investigation will be needed to maximize the effectiveness for certain applications, such as recommendation and gender identification, of the proposed method, for instance, by giving a higher weight to a less frequent BoFT label. There are two possible directions for improving the precision. As the features extracted from images are a low level description, even two images with exactly the same feature vector could be two completely different images. This could be solved by combining other forms of feature vectors, such as distribution of HSV color, or other feature extraction techniques, such as GIFT. Another highlighted direction is the value of K, the number of labels. As discussed previously, the number of labels, K, or the number of clusters in clustering, has to be pre-defined. A too small value could make two dissimilar images be annotated with the same label, while a too large number will cause two similar images with different labels. Strategies such as that in [39] combine the advantages of on-line clustering [40] and mean-shift [41] in an under sampling framework [42]. The method does not require knowing k in advance, and performs better than k- means in image categorization [39]. Those directions can help to improve the results of connection discovery. With the connections among users, many interesting applications, such as centrality analysis, recommendation, virality prediction, and many other applications [43][44][45][46] become possible. VII. CONCLUSION AND FUTURE WORK This work has proposed a connection discovery method and system for follower/followee recommendation based on user shared images. A practical method, BoFT, is discussed to label user shared images with BoFT labels on over 360,000 user shared images. The characteristics of user shared images are then investigated and modeled as exponential distributions based on the analysis of 3 million follower/followee relationships from two social networks with different origins, Skyrock and 163 Weibo, for which similar observations are found. Based on the observations, a practical follower/followee recommendation system is proposed and formulated with the discovered connections, which are extensively verified with ground truth. It is concluded that follower/followee recommendation using discovered connections by user shared images is possible, and the recommendation is 60% better than UserT and achieves 25% of the performance of FoF, a method used when limited access SGs are available. The discovered connections are also proven to be able to identify user gender. These findings create a potential long term impact and contribution to scientific research and commercial applications, especially when access to SGs is difficult or limited. This work enables the use of social network analysis on any social media with image sharing mechanisms, for which many interesting applications, such as centrality analysis, recommendation, virality prediction, and many other applications become possible. ACKNOWLEDGMENT This work is supported by the HKUST-NIE Social Media Lab., HKUST. REFERENCES [1] J. Chen, W. Geyer, C. Dugan, M. Muller and I. Guy, Make new friends, but keep the old: Recommending people on social networking sites, in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp (2009). [2] V. Leroy, B. B. Cambazoglu and F. Bonchi, Cold start link prediction, in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp (2010). [3] I. Kahanda and J. Neville, Using transactional information to predict link strength in online social networks. in Proceedings of the 3rd International AAAI Conference on Weblogs and Social Media, pp (2009). [4] L. Backstrom and J. Leskovec, Supervised random walks: Predicting and recommending links in social networks, in Proceedings of the 4th ACM International Conference on Web Search and Data Mining, pp (2011). [5] D. Krackhardt and M. Kilduff, Whether close or far: Social distance effects on perceived balance in friendship networks. Journal of Personality and Social Psychology, vol. 76, pp. 770 (1999). [6] J. Leskovec, D. Huttenlocher and J. Kleinberg, Predicting positive and negative links in online social networks, in Proceedings of the 19th International Conference on World Wide Web, pp (2010). [7] Y. Zheng, L. Zhang, Z. Ma, X. Xie and W. Ma, Recommending friends and locations based on individual location history, ACM Transactions on the Web (TWEB), vol. 5, pp. 5 (2011). [8] A. Rae, B. Sigurbjrnsson and R. van Zwol, Improving tag recommendation using social networks, In Proceedings of the International Conference on Adaptivity, Personalization and Fusion of Heterogeneous Information, pp (2010). [9] R. Ottoni, J. P. Pesce, D. B. Las Casas, G. Franciscani Jr, W. Meira Jr, P. Kumaraguru and V. Almeida, Ladies first: Analyzing gender roles and behaviors in pinterest. in Proceedings of the 7th International AAAI Conference on Weblogs and Social Media, (2013) [10] L. Kennedy, M. Naaman, S. Ahern, R. Nair and T. Rattenbury, How flickr helps us make sense of the world: Context and content in community-contributed media collections, in Proceedings of the 15th International Conference on Multimedia, pp (2007). [11] A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel and B. Bhattacharjee, Measurement and analysis of online social networks, in Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp (2007). [12] Jin, Emily M., Michelle Girvan, and Mark EJ Newman. Structure of growing social networks. Physical review E 64.4 (2001): [13] L. L and T. Zhou, Link prediction in complex networks: A survey, Physica A: Statistical Mechanics and its Applications, vol. 390, pp (2011).
12 IEEE TRANSECTIONS ON MULTIMEDIA, VOL. 0, NO. 0, FEBRUARY 2015 [14] I. Guy, N. Zwerdling, I. Ronen, D. Carmel and E. Uziel, Social media recommendation based on people and tags, in Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp (2010). [15] I. Guy, N. Zwerdling, D. Carmel, I. Ronen, E. Uziel, S. Yogev and S. Ofek-Koifman, Personalized recommendation of social software items based on social relations, in Proceedings of the 3rd ACM Conference on Recommender Systems, pp (2009). [16] R. Parimi and D. Caragea, Predicting friendship links in social networks using a topic modeling approach, in Advances in Knowledge Discovery and Data Mining, Springer, pp (2011). [17] W. H. Hsu, A. L. King, M. S. Paradesi, T. Pydimarri and T. Weninger, Collaborative and structural recommendation of friends using weblogbased social network analysis. in AAAI Spring Symposium: Computational Approaches to Analyzing Weblogs, pp (2006). [18] X. Xie, Potential friend recommendation in online social network, in IEEE International Conference on Cyber, Physical and Social Computing (CPSCom), pp (2010). [19] Chow, Wing S., and Lai Sheung Chan. Social network, social trust and shared goals in organizational knowledge sharing. Information & Management 45.7: pp (2008). [20] E. Gilbert and K. Karahalios, Predicting tie strength with social media, in Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp (2009). [21] S. A. Golder and S. Yardi, Structural predictors of tie formation in twitter: Transitivity and mutuality, in Social Computing (SocialCom), 2010 IEEE Second International Conference on, pp (2010). [22] S. Yang, B. Long, A. Smola, N. Sadagopan, Z. Zheng and H. Zha, Like like alike: Joint friendship and interest propagation in social networks, in Proceedings of the 20th International Conference on World Wide Web, pp (2011). [23] M. Cheung and J. She. Bag-of-features tagging approach for a better recommendation with social big data. in Proceedings of the 5th International Conference on Advances in Information Mining and Management. (2014). [24] H. Kim, J. Jung and A. El Saddik, Associative face co-occurrence networks for recommending friends in social networks, in Proceedings of 2nd ACM SIGMM Workshop on Social Media, pp (2010). [25] X. Li, L. Guo and Y. E. Zhao, Tag-based social interest discovery, in Proceedings of the 17th International Conference on World Wide Web, pp (2008). [26] T. C. Zhou, H. Ma, M. R. Lyu and I. King, UserRec: A user recommendation framework in social tagging systems. in Proceedings of the 24th AAAI Conference on Artificial Intelligence, (2010). [27] A. Shepitsen, J. Gemmell, B. Mobasher and R. Burke, Personalized recommendation in social tagging systems using hierarchical clustering, in Proceedings of the 2008 ACM Conference on Recommender Systems, pp (2008). [28] X. Zhang, X. Zhao, Z. Li, J. Xia, R. Jain and W. Chao, Social image tagging using graph-based reinforcement on multi-type interrelated objects, in Signal Process, vol. 93, no. 8, pp (2013). [29] X. Zhang, Z. Li and W. Chao, Tagging image by merging multiple features in a integrated manner, in Journal of Intelligent Information Systems, vol. 39, pp (2012). [30] B. Sigurbjrnsson and R. Van Zwol, Flickr tag recommendation based on collective knowledge, in Proceedings of the 17th International Conference on World Wide Web, pp (2008). [31] J. Sang, C. Xu and J. Liu, User-aware image tag refinement via ternary semantic analysis, IEEE Transactions on Multimedia, vol. 14, no. 3, pp (2012). [32] E. Moxley, J. Kleban, J. Xu and B. Manjunath, Not all tags are created equal: Learning flickr tag semantics for global annotation, in Proceedings of IEEE International Conference on Multimedia & Expo, pp (2009). [33] Z. Wang, L. Sun, W. Zhu, S. Yang, H. Li and D. Wu, Joint Social and Content Recommendation for User-Generated Videos in Online Social Network, IEEE Transactions on Multimedia, Vol.15, no. 3, pp (2013). [34] T. Kadir and M. Brady, Saliency, scale and image description, International Journal of Computer Vision, vol. 45, pp (2001). [35] D. G. Lowe, Distinctive image features from scale-invariant keypoints, International Journal of Computer Vision, vol. 60, pp (2004). [36] A. McCallum, K. Nigam and L. H. Ungar, Efficient clustering of high-dimensional data sets with application to reference matching, in Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp (2000). 12 [37] Y. Linde, A. Buzo and R. M. Gray, An algorithm for vector quantizer design, IEEE Transactions on Communications, vol. 28, pp (1980). [38] Z. Jie, M. Cheung and J. She, A cloud-assisted framework for bag-offeatures tagging in social networks in IEEE 4th Symposium on Network Cloud Computing and Applications, (2015). [39] F. Jurie and B. Triggs, Creating efficient codebooks for visual recognition, in 10th IEEE International Conference on Computer Vision, ICCV 2005, pp (2005). [40] A. Meyerson, Online facility location, in Proceedings. 42nd IEEE Symposium on Foundations of Computer Science, pp (2001). [41] D. Comaniciu and P. Meer, Mean shift: A robust approach toward feature space analysis, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, pp (2002). [42] A. Estabrooks, T. Jo and N. Japkowicz, A multiple resampling method for learning from imbalanced data sets, Computing Intelligent, vol. 20, pp (2004). [43] L. Weng, A. Flammini, A. Vespignani and F. Menczer, Competition among memes in a world with limited attention, Scientific Reports, vol. 2, (2012). [44] Freeman, Linton C. Centrality in social networks conceptual clarification. in Social networks, Vol. 1, Issue 3, pp (1979). [45] F. E. Walter, S. Battiston and F. Schweitzer, A model of a trust-based recommendation system on a social network, in Autonomous Agents and Multi-Agent Systems, vol. 16, no. 1, pp (2008). [46] I. Konstas, V. Stathopoulos, and J. M. Jose. On social networks and collaborative recommendation. Proceedings of the 32nd international ACM SIGIR conference on Research and Development in Information Retrieval. ACM, (2009). Ming Cheung was born in Hong Kong. He received his B.Eng. and M.Phil in Electronic and Computer Engineering at Hong Kong University of Science and Technology (HKUST) in 2010 and 2012 respectively. He joined the HKUST-NIE Social Media Lab, Asia s first social media lab, in 2012 as a research assistant, and currently is a Ph.D. candidate at HKUST. His research interests include social media analytics, information diffusions and user behavior predictions. James She is an assistant professor in the Department of Electronic and Computer Engineering at the Hong Kong University of Science and Technology (HKUST), and a visiting research fellow at the University of Cambridge. He is also the founding director of Asia s first social media lab, HKUST-NIE Social Media Lab, and spearheads multidisciplinary research and innovation in cyber-physical social media systems, viral media analytics and mobile media broadcast systems. Celebrated as a thought leader in new media and emerging cyber-physical societies, James is a member of the World Economic Forum s Global Agenda Council (Social Media) and joins other government and business leaders to develop solutions to key social media issues on the global agenda. Zhanming Jie was born in Guangdong, China. He received his B.Eng. in School of Automation Engineering at University of Electronic Science and Technology of China in During his finalyear undergraduate period, he worked at Singapore University of Technology and Design as an intern. He is currently a Ph.D student at HKUST-Nie Social Media Lab. His research interest includes machine learning, social network and recommender system.
Community-Aware Prediction of Virality Timing Using Big Data of Social Cascades
1 Community-Aware Prediction of Virality Timing Using Big Data of Social Cascades Alvin Junus, Ming Cheung, James She and Zhanming Jie HKUST-NIE Social Media Lab, Hong Kong University of Science and TechnologyMore information
MALLET-Privacy Preserving Influencer Mining in Social Media Networks via Hypergraph
MALLET-Privacy Preserving Influencer Mining in Social Media Networks via Hypergraph Janani K 1, Narmatha S 2 Assistant Professor, Department of Computer Science and Engineering, Sri Shakthi Institute ofMore information
Comparison of K-means and Backpropagation Data Mining Algorithms
Comparison of K-means and Backpropagation Data Mining Algorithms Nitu Mathuriya, Dr. Ashish Bansal Abstract Data mining has got more and more mature as a field of basic research in computer science andMore information
Personalizing Image Search from the Photo Sharing Websites
Personalizing Image Search from the Photo Sharing Websites Swetha.P.C, Department of CSE, Atria IT, Bangalore email@example.com Aishwarya.P Professor, Dept.of CSE, Atria IT, Bangalore email@example.com information
Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network
, pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 andMore information
Social Media Mining. Data Mining Essentials
Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customersMore information
Large-Scale Data Sets Clustering Based on MapReduce and Hadoop
Journal of Computational Information Systems 7: 16 (2011) 5956-5963 Available at http://www.jofcis.com Large-Scale Data Sets Clustering Based on MapReduce and Hadoop Ping ZHOU, Jingsheng LEI, Wenjun YEMore information
Florida International University - University of Miami TRECVID 2014
Florida International University - University of Miami TRECVID 2014 Miguel Gavidia 3, Tarek Sayed 1, Yilin Yan 1, Quisha Zhu 1, Mei-Ling Shyu 1, Shu-Ching Chen 2, Hsin-Yu Ha 2, Ming Ma 1, Winnie Chen 4,More information
Machine Learning using MapReduce
Machine Learning using MapReduce What is Machine Learning Machine learning is a subfield of artificial intelligence concerned with techniques that allow computers to improve their outputs based on previousMore information
Fig. 1 A typical Knowledge Discovery process [2]
Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Review on ClusteringMore information
Clustering Technique in Data Mining for Text Documents
Clustering Technique in Data Mining for Text Documents Ms.J.Sathya Priya Assistant Professor Dept Of Information Technology. Velammal Engineering College. Chennai. Ms.S.Priyadharshini Assistant ProfessorMore information
Categorical Data Visualization and Clustering Using Subjective Factors
Categorical Data Visualization and Clustering Using Subjective Factors Chia-Hui Chang and Zhi-Kai Ding Department of Computer Science and Information Engineering, National Central University, Chung-Li,More information
Self Organizing Maps for Visualization of Categories
Self Organizing Maps for Visualization of Categories Julian Szymański 1 and Włodzisław Duch 2,3 1 Department of Computer Systems Architecture, Gdańsk University of Technology, Poland, firstname.lastname@example.com information
Canonical Image Selection for Large-scale Flickr Photos using Hadoop
Canonical Image Selection for Large-scale Flickr Photos using Hadoop Guan-Long Wu National Taiwan University, Taipei Nov. 10, 2009, @NCHC Communication and Multimedia Lab ( 通 訊 與 多 媒 體 實 驗 室 ), DepartmentMore information
Pharos: Social Map-Based Recommendation for Content-Centric Social Websites
Pharos: Social Map-Based Recommendation for Content-Centric Social Websites Wentao Zheng Michelle Zhou Shiwan Zhao Quan Yuan Xiatian Zhang Changyan Chi IBM Research China IBM Research Almaden ABSTRACTMore information
Knowledge Discovery from patents using KMX Text Analytics
Knowledge Discovery from patents using KMX Text Analytics Dr. Anton Heijs firstname.lastname@example.com Treparel Abstract In this white paper we discuss how the KMX technology of Treparel can help searchersMore information
Optimized Offloading Services in Cloud Computing Infrastructure
Optimized Offloading Services in Cloud Computing Infrastructure 1 Dasari Anil Kumar, 2 J.Srinivas Rao 1 Dept. of CSE, Nova College of Engineerng & Technology,Vijayawada,AP,India. 2 Professor, Nova CollegeMore information
Term extraction for user profiling: evaluation by the user
Term extraction for user profiling: evaluation by the user Suzan Verberne 1, Maya Sappelli 1,2, Wessel Kraaij 1,2 1 Institute for Computing and Information Sciences, Radboud University Nijmegen 2 TNO,More information
EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set
EM Clustering Approach for Multi-Dimensional Analysis of Big Data Set Amhmed A. Bhih School of Electrical and Electronic Engineering Princy Johnson School of Electrical and Electronic Engineering MartinMore information
Applied Artificial Intelligence, 17:375 381, 2003 Copyright # 2003 Taylor & Francis 0883-9514/03 $12.00 +.00 DOI: 10.1080/08839510390219264 u DATA PREPARATION FOR DATA MINING SHICHAO ZHANG and CHENGQIMore information
Figure 1. The cloud scales: Amazon EC2 growth [2].
- Chung-Cheng Li and Kuochen Wang Department of Computer Science National Chiao Tung University Hsinchu, Taiwan 300 firstname.lastname@example.com, firstname.lastname@example.com Abstract One of the most important issuesMore information
Performance Analysis of Naive Bayes and J48 Classification Algorithm for Data Classification
Performance Analysis of Naive Bayes and J48 Classification Algorithm for Data Classification Tina R. Patil, Mrs. S. S. Sherekar Sant Gadgebaba Amravati University, Amravati email@example.com, email@example.com information
Distributed Framework for Data Mining As a Service on Private Cloud
RESEARCH ARTICLE OPEN ACCESS Distributed Framework for Data Mining As a Service on Private Cloud Shraddha Masih *, Sanjay Tanwani** *Research Scholar & Associate Professor, School of Computer Science &More information
Comparative Analysis of EM Clustering Algorithm and Density Based Clustering Algorithm Using WEKA tool.
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 9, Issue 8 (January 2014), PP. 19-24 Comparative Analysis of EM Clustering AlgorithmMore information
Bisecting K-Means for Clustering Web Log data
Bisecting K-Means for Clustering Web Log data Ruchika R. Patil Department of Computer Technology YCCE Nagpur, India Amreen Khan Department of Computer Technology YCCE Nagpur, India ABSTRACT Web usage miningMore information
Text Mining Approach for Big Data Analysis Using Clustering and Classification Methodologies
Text Mining Approach for Big Data Analysis Using Clustering and Classification Methodologies Somesh S Chavadi 1, Dr. Asha T 2 1 PG Student, 2 Professor, Department of Computer Science and Engineering,More information
Segmentation & Clustering
EECS 442 Computer vision Segmentation & Clustering Segmentation in human vision K-mean clustering Mean-shift Graph-cut Reading: Chapters 14 [FP] Some slides of this lectures are courtesy of prof F. Li,More information
CLASSIFYING NETWORK TRAFFIC IN THE BIG DATA ERA Professor Yang Xiang Network Security and Computing Laboratory (NSCLab) School of Information Technology Deakin University, Melbourne, Australia http://anss.org.au/nsclabMore information
MLg. Big Data and Its Implication to Research Methodologies and Funding. Cornelia Caragea TARDIS 2014. November 7, 2014. Machine Learning Group
Big Data and Its Implication to Research Methodologies and Funding Cornelia Caragea TARDIS 2014 November 7, 2014 UNT Computer Science and Engineering Data Everywhere Lots of data is being collected andMore information
SCHEDULING IN CLOUD COMPUTING Lipsa Tripathy, Rasmi Ranjan Patra CSA,CPGS,OUAT,Bhubaneswar,Odisha Abstract Cloud computing is an emerging technology. It process huge amount of data so scheduling mechanismMore information
Data Mining Project Report. Document Clustering. Meryem Uzun-Per
Data Mining Project Report Document Clustering Meryem Uzun-Per 504112506 Table of Content Table of Content... 2 1. Project Definition... 3 2. Literature Survey... 3 3. Methods... 4 3.1. K-means algorithm...More information
Face Recognition using SIFT Features
Face Recognition using SIFT Features Mohamed Aly CNS186 Term Project Winter 2006 Abstract Face recognition has many important practical applications, like surveillance and access control.More information
Ranked Keyword Search in Cloud Computing: An Innovative Approach
International Journal of Computational Engineering Research Vol, 03 Issue, 6 Ranked Keyword Search in Cloud Computing: An Innovative Approach 1, Vimmi Makkar 2, Sandeep Dalal 1, (M.Tech) 2,(Assistant professor)More information
A QoS-Aware Web Service Selection Based on Clustering
International Journal of Scientific and Research Publications, Volume 4, Issue 2, February 2014 1 A QoS-Aware Web Service Selection Based on Clustering R.Karthiban PG scholar, Computer Science and Engineering,More information
Big Data Is Not Yet Another IT Project. Krish Krishnan President, Sixth Sense Advisors Inc Bridge to Big Data Oct 23 rd 2012
Big Data Is Not Yet Another IT Project Krish Krishnan President, Sixth Sense Advisors Inc Bridge to Big Data Oct 23 rd 2012 Background Applications, OLTP Systems, Traditional Data Warehouse and BusinessMore information
Personalized Image Search for Photo Sharing Website
Personalized Image Search for Photo Sharing Website Asst. Professor Rajni Pamnani firstname.lastname@example.com Manan Desai email@example.com Varshish Bhanushali email@example.com Ashish Charla firstname.lastname@example.com information
Journal homepage: www.mjret.in ISSN:2348-6953 PULLING OUT OPINION TARGETS AND OPINION WORDS FROM REVIEWS BASED ON THE WORD ALIGNMENT MODEL AND USING TOPICAL WORD TRIGGER MODEL Utkarsha Vibhute, Prof. SoumitraMore information
Search Result Optimization using Annotators
Search Result Optimization using Annotators Vishal A. Kamble 1, Amit B. Chougule 2 1 Department of Computer Science and Engineering, D Y Patil College of engineering, Kolhapur, Maharashtra, India 2 Professor,More information
Using Data Mining for Mobile Communication Clustering and Characterization
Using Data Mining for Mobile Communication Clustering and Characterization A. Bascacov *, C. Cernazanu ** and M. Marcu ** * Lasting Software, Timisoara, Romania ** Politehnica University of Timisoara/ComputerMore information
Image Search by MapReduce
Image Search by MapReduce COEN 241 Cloud Computing Term Project Final Report Team #5 Submitted by: Lu Yu Zhe Xu Chengcheng Huang Submitted to: Prof. Ming Hwa Wang 09/01/2015 Preface Currently, there sMore information
Research of Postal Data mining system based on big data
3rd International Conference on Mechatronics, Robotics and Automation (ICMRA 2015) Research of Postal Data mining system based on big data Xia Hu 1, Yanfeng Jin 1, Fan Wang 1 1 Shi Jiazhuang Post & TelecommunicationMore information
Hadoop SNS. renren.com. Saturday, December 3, 11
Hadoop SNS renren.com Saturday, December 3, 11 2.2 190 40 Saturday, December 3, 11 Saturday, December 3, 11 Saturday, December 3, 11 Saturday, December 3, 11 Saturday, December 3, 11 Saturday, DecemberMore information
An Overview of Knowledge Discovery Database and Data mining Techniques
An Overview of Knowledge Discovery Database and Data mining Techniques Priyadharsini.C 1, Dr. Antony Selvadoss Thanamani 2 M.Phil, Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu,More information
A Genetic Algorithm-Evolved 3D Point Cloud Descriptor
A Genetic Algorithm-Evolved 3D Point Cloud Descriptor Dominik Wȩgrzyn and Luís A. Alexandre IT - Instituto de Telecomunicações Dept. of Computer Science, Univ. Beira Interior, 6200-001 Covilhã, PortugalMore information
A Framework of User-Driven Data Analytics in the Cloud for Course Management
A Framework of User-Driven Data Analytics in the Cloud for Course Management Jie ZHANG 1, William Chandra TJHI 2, Bu Sung LEE 1, Kee Khoon LEE 2, Julita VASSILEVA 3 & Chee Kit LOOI 4 1 School of ComputerMore information
Methodology for Emulating Self Organizing Maps for Visualization of Large Datasets
Methodology for Emulating Self Organizing Maps for Visualization of Large Datasets Macario O. Cordel II and Arnulfo P. Azcarraga College of Computer Studies *Corresponding Author: firstname.lastname@example.com information
Clustering Connectionist and Statistical Language Processing
Clustering Connectionist and Statistical Language Processing Frank Keller firstname.lastname@example.com Computerlinguistik Universität des Saarlandes Clustering p.1/21 Overview clustering vs. classification supervisedMore information
An Analysis of Verifications in Microblogging Social Networks - Sina Weibo
An Analysis of Verifications in Microblogging Social Networks - Sina Weibo Junting Chen and James She HKUST-NIE Social Media Lab Dept. of Electronic and Computer Engineering The Hong Kong University ofMore information
Active Learning SVM for Blogs recommendation
Active Learning SVM for Blogs recommendation Xin Guan Computer Science, George Mason University Ⅰ.Introduction In the DH Now website, they try to review a big amount of blogs and articles and find theMore information
International Journal of Engineering Research ISSN: 2348-4039 & Management Technology November-2015 Volume 2, Issue-6
International Journal of Engineering Research ISSN: 2348-4039 & Management Technology Email: firstname.lastname@example.com November-2015 Volume 2, Issue-6 www.ijermt.org Modeling Big Data Characteristics for DiscoveringMore information
Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information
Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information EngineeringMore information
Steven C.H. Hoi School of Information Systems Singapore Management University Email: email@example.com
Steven C.H. Hoi School of Information Systems Singapore Management University Email: email@example.com Introduction http://stevenhoi.org/ Finance Recommender Systems Cyber Security Machine Learning VisualMore information
Comparision of k-means and k-medoids Clustering Algorithms for Big Data Using MapReduce Techniques
Comparision of k-means and k-medoids Clustering Algorithms for Big Data Using MapReduce Techniques Subhashree K 1, Prakash P S 2 1 Student, Kongu Engineering College, Perundurai, Erode 2 Assistant Professor,More information
Crowdclustering with Sparse Pairwise Labels: A Matrix Completion Approach
Outline Crowdclustering with Sparse Pairwise Labels: A Matrix Completion Approach Jinfeng Yi, Rong Jin, Anil K. Jain, Shaili Jain 2012 Presented By : KHALID ALKOBAYER Crowdsourcing and CrowdclusteringMore information
DATA MINING CLUSTER ANALYSIS: BASIC CONCEPTS 1 AND ALGORITHMS Chiara Renso KDD-LAB ISTI- CNR, Pisa, Italy WHAT IS CLUSTER ANALYSIS? Finding groups of objects such that the objects in a group will be similarMore information
Method of Fault Detection in Cloud Computing Systems
, pp.205-212 http://dx.doi.org/10.14257/ijgdc.2014.7.3.21 Method of Fault Detection in Cloud Computing Systems Ying Jiang, Jie Huang, Jiaman Ding and Yingli Liu Yunnan Key Lab of Computer Technology Application,More information
Comparing Tag Clouds, Term Histograms, and Term Lists for Enhancing Personalized Web Search
Comparing Tag Clouds, Term Histograms, and Term Lists for Enhancing Personalized Web Search Orland Hoeber and Hanze Liu Department of Computer Science, Memorial University St. John s, NL, Canada A1B 3X5More information
Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services
Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services Ms. M. Subha #1, Mr. K. Saravanan *2 # Student, * Assistant Professor Department of Computer Science and Engineering RegionalMore information
HOW TO MAKE SENSE OF BIG DATA TO BETTER DRIVE BUSINESS PROCESSES, IMPROVE DECISION-MAKING, AND SUCCESSFULLY COMPETE IN TODAY S MARKETS. ALTILIA turns Big Data into Smart Data and enables businesses toMore information
A Study of Web Log Analysis Using Clustering Techniques
A Study of Web Log Analysis Using Clustering Techniques Hemanshu Rana 1, Mayank Patel 2 Assistant Professor, Dept of CSE, M.G Institute of Technical Education, Gujarat India 1 Assistant Professor, DeptMore information
Fast Matching of Binary Features
Fast Matching of Binary Features Marius Muja and David G. Lowe Laboratory for Computational Intelligence University of British Columbia, Vancouver, Canada {mariusm,firstname.lastname@example.com Abstract There has beenMore information
Tracking and Recognition in Sports Videos
Tracking and Recognition in Sports Videos Mustafa Teke a, Masoud Sattari b a Graduate School of Informatics, Middle East Technical University, Ankara, Turkey firstname.lastname@example.com b Department of ComputerMore information
An Introduction to Data Mining. Big Data World. Related Fields and Disciplines. What is Data Mining? 2/12/2015
An Introduction to Data Mining for Wind Power Management Spring 2015 Big Data World Every minute: Google receives over 4 million search queries Facebook users share almost 2.5 million pieces of contentMore information
The Scientific Data Mining Process
Chapter 4 The Scientific Data Mining Process When I use a word, Humpty Dumpty said, in rather a scornful tone, it means just what I choose it to mean neither more nor less. Lewis Carroll [87, p. 214] InMore information
Towards Inferring Web Page Relevance An Eye-Tracking Study
Towards Inferring Web Page Relevance An Eye-Tracking Study 1, firstname.lastname@example.com Yinglong Zhang 1, email@example.com 1 The University of Texas at Austin Abstract We present initial results from a project,More information
Clustering in Machine Learning. By: Ibrar Hussain Student ID:
Clustering in Machine Learning By: Ibrar Hussain Student ID: 11021083 Presentation An Overview Introduction Definition Types of Learning Clustering in Machine Learning K-means Clustering Example of k-meansMore information
Similarity Search in a Very Large Scale Using Hadoop and HBase
Similarity Search in a Very Large Scale Using Hadoop and HBase Stanislav Barton, Vlastislav Dohnal, Philippe Rigaux LAMSADE - Universite Paris Dauphine, France Internet Memory Foundation, Paris, FranceMore information
A Proposed Framework for Ranking and Reservation of Cloud Services Based on Quality of Service
II,III A Proposed Framework for Ranking and Reservation of Cloud Services Based on Quality of Service I Samir.m.zaid, II Hazem.m.elbakry, III Islam.m.abdelhady I Dept. of Geology, Faculty of Sciences,More information
Web Document Clustering
Web Document Clustering Lab Project based on the MDL clustering suite http://www.cs.ccsu.edu/~markov/mdlclustering/ Zdravko Markov Computer Science Department Central Connecticut State University New Britain,More information
Predict Influencers in the Social Network
Predict Influencers in the Social Network Ruishan Liu, Yang Zhao and Liuyu Zhou Email: rliu2, yzhao2, firstname.lastname@example.com Department of Electrical Engineering, Stanford University Abstract Given two personsMore information
Diagnosis of Students Online Learning Portfolios
Diagnosis of Students Online Learning Portfolios Chien-Ming Chen 1, Chao-Yi Li 2, Te-Yi Chan 3, Bin-Shyan Jong 4, and Tsong-Wuu Lin 5 Abstract - Online learning is different from the instruction providedMore information
Network Big Data: Facing and Tackling the Complexities Xiaolong Jin
Network Big Data: Facing and Tackling the Complexities Xiaolong Jin CAS Key Laboratory of Network Data Science & Technology Institute of Computing Technology Chinese Academy of Sciences (CAS) 2015-08-10More information
STUDIA UNIV. BABEŞ BOLYAI, INFORMATICA, Volume LIX, Number 1, 2014 A STUDY REGARDING INTER DOMAIN LINKED DOCUMENTS SIMILARITY AND THEIR CONSEQUENT BOUNCE RATE DIANA HALIŢĂ AND DARIUS BUFNEA Abstract. ThenMore information
Advances in Natural and Applied Sciences
AENSI Journals Advances in Natural and Applied Sciences ISSN:1995-0772 EISSN: 1998-1090 Journal home page: www.aensiweb.com/anas Clustering Algorithm Based On Hadoop for Big Data 1 Jayalatchumy D. andMore information
Data Mining in Web Search Engine Optimization and User Assisted Rank Results
Data Mining in Web Search Engine Optimization and User Assisted Rank Results Minky Jindal Institute of Technology and Management Gurgaon 122017, Haryana, India Nisha kharb Institute of Technology and ManagementMore information
Parallel Data Selection Based on Neurodynamic Optimization in the Era of Big Data
Parallel Data Selection Based on Neurodynamic Optimization in the Era of Big Data Jun Wang Department of Mechanical and Automation Engineering The Chinese University of Hong Kong Shatin, New Territories,More information
Cloud-Empowered Multimedia Service: An Automatic Video Storytelling Tool
Cloud-Empowered Multimedia Service: An Automatic Video Storytelling Tool Joseph C. Tsai Foundation of Computer Science Lab. The University of Aizu Fukushima-ken, Japan firstname.lastname@example.com Abstract VideoMore information
AN APPROACH FOR SUPERVISED SEMANTIC ANNOTATION A. DORADO AND E. IZQUIERDO Queen Mary, University of London Electronic Engineering Department Mile End Road, London E1 4NS, U.K. E-mail: {andres.dorado, firstname.lastname@example.com information
Extracting Information from Social Networks
Extracting Information from Social Networks Aggregating site information to get trends 1 Not limited to social networks Examples Google search logs: flu outbreaks We Feel Fine Bullying 2 Bullying Xu, Jun,More information
Parallel Programming Map-Reduce. Needless to Say, We Need Machine Learning for Big Data
Case Study 2: Document Retrieval Parallel Programming Map-Reduce Machine Learning/Statistics for Big Data CSE599C1/STAT592, University of Washington Carlos Guestrin January 31 st, 2013 Carlos GuestrinMore information
Selection of Optimal Discount of Retail Assortments with Data Mining Approach
Available online at www.interscience.in Selection of Optimal Discount of Retail Assortments with Data Mining Approach Padmalatha Eddla, Ravinder Reddy, Mamatha Computer Science Department,CBIT, Gandipet,Hyderabad,A.P,India.More information
Object Recognition. Selim Aksoy. Bilkent University email@example.com
Image Classification and Object Recognition Selim Aksoy Department of Computer Engineering Bilkent University firstname.lastname@example.com Image classification Image (scene) classification is a fundamentalMore information
, pp.-40-44. Available online at http://www. bioinfo. in/contents. php?id=42 SPATIAL DATA CLASSIFICATION AND DATA MINING RATHI J.B. * AND PATIL A.D. Department of Computer Science & Engineering, JawaharlalMore information
An Enhanced Clustering Algorithm to Analyze Spatial Data
International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-2, Issue-7, July 2014 An Enhanced Clustering Algorithm to Analyze Spatial Data Dr. Mahesh Kumar, Mr. Sachin YadavMore information
Overview. Clustering. Clustering vs. Classification. Supervised vs. Unsupervised Learning. Connectionist and Statistical Language Processing
Overview Clustering Connectionist and Statistical Language Processing Frank Keller firstname.lastname@example.com Computerlinguistik Universität des Saarlandes clustering vs. classification supervised vs. unsupervisedMore information
Patient Similarity-guided Decision Support
Patient Similarity-guided Decision Support Tanveer Syeda-Mahmood, PhD IBM Almaden Research Center May 2014 2014 IBM Corporation What is clinical decision support? Rule-based expert systems curated by people,More information
Modeling and Design of Intelligent Agent System
International Journal of Control, Automation, and Systems Vol. 1, No. 2, June 2003 257 Modeling and Design of Intelligent Agent System Dae Su Kim, Chang Suk Kim, and Kee Wook Rim Abstract: In this study,More information
Conventional. Personalized
Volume 3, Issue 8, August 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com PersonalizedMore information
The Enron Corpus: A New Dataset for Email Classification Research
The Enron Corpus: A New Dataset for Email Classification Research Bryan Klimt and Yiming Yang Language Technologies Institute Carnegie Mellon University Pittsburgh, PA 15213-8213, USA {bklimt,firstname.lastname@example.com information
SURVEY REPORT DATA SCIENCE SOCIETY 2014 TABLE OF CONTENTS Contents About the Initiative 1 Report Summary 2 Participants Info 3 Participants Expertise 6 Suggested Discussion Topics 7 Selected ResponsesMore information
Open Access Research on Application of Neural Network in Computer Network Security Evaluation. Shujuan Jin *
Send Orders for Reprints to email@example.com 766 The Open Electrical & Electronic Engineering Journal, 2014, 8, 766-771 Open Access Research on Application of Neural Network in Computer NetworkMore information
CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW 1 XINQIN GAO, 2 MINGSHUN YANG, 3 YONG LIU, 4 XIAOLI HOU School of Mechanical and Precision Instrument Engineering, Xi'an UniversityMore information
ISSN:2320-0790 ATTRIBUTE ENHANCED SPARSE CODING FOR FACE IMAGE RETRIEVAL MILU SAYED, LIYA NOUSHEER PG Research Scholar, ICET ABSTRACT: Content based face image retrieval is an emerging technology. It sMore information
A SYSTEM FOR CROWD ORIENTED EVENT DETECTION, TRACKING, AND SUMMARIZATION IN SOCIAL MEDIA An Undergraduate Research Scholars Thesis by JASON M. BOLDEN Submitted to Honors and Undergraduate Research TexasMore information
Clustering Big Data. Anil K. Jain. (with Radha Chitta and Rong Jin) Department of Computer Science Michigan State University November 29, 2012
Clustering Big Data Anil K. Jain (with Radha Chitta and Rong Jin) Department of Computer Science Michigan State University November 29, 2012 Outline Big Data How to extract information? Data clusteringMore information
ANALYSIS OF THE EFFECTIVENESS IN IMAGE COMPRESSION FOR CLOUD STORAGE FOR VARIOUS IMAGE FORMATS Dasaradha Ramaiah K. 1 and T. Venugopal 2 1 IT Department, BVRIT, Hyderabad, India 2 CSE Department, JNTUH,More information
Contact Recommendations from Aggegrated On-Line Activity
Contact Recommendations from Aggegrated On-Line Activity Abigail Gertner, Justin Richer, and Thomas Bartee The MITRE Corporation 202 Burlington Road, Bedford, MA 01730 {gertner,jricher,firstname.lastname@example.com information
Twitter Analytics: Architecture, Tools and Analysis
Twitter Analytics: Architecture, Tools and Analysis Rohan D.W Perera CERDEC Ft Monmouth, NJ 07703-5113 S. Anand, K. P. Subbalakshmi and R. Chandramouli Department of ECE, Stevens Institute Of TechnologyMore information
Research on News Video Multi-topic Extraction and Summarization
International Journal of New Technology and Research (IJNTR) ISSN:2454-4116, Volume-2, Issue-3, March 2016 Pages 37-39 Research on News Video Multi-topic Extraction and Summarization Di Li, Hua Huo AbstractMore information
Journal homepage: www.mjret.in ISSN:2348-6953 IMPROVING BUSINESS PROCESS MODELING USING RECOMMENDATION METHOD Deepak Ramchandara Lad 1, Soumitra S. Das 2 Computer Dept. 12 Dr. D. Y. Patil School of Engineering,(AffiliatedMore information


text:
Mike Acker
Do I Love You? - Poem by Mike Acker
Do I love you?
Yes, of course
I do.
Did I always?
Yes, of course
I did.
It's when
you ask:
' Then, why? ',
that I can
give no answer.
I simply did
what I had to do.
I told the lies
and whispered
the bitter-sweet
you needed to hear
and acted the roles
and painted the smiles
on the masks
I had to wear
that covered
the pains.
I built the sets
which you needed
to walk through
in order for you
to stay with me.
For, it was always
about the whys
and not the lies.
It was never the lines
but what's between,
where the meanings died.
All that smoke
and all those mirrors
and the mirages
I needed to make
all for you
and never for me.
We had to dance
The Dance,
that grand
Dance of Deceits.
It's what gives
the life which
gives no damn
about our hows,
and, of course,
our whys.
Mike Acker
Topic(s) of this poem: Love
Comments about Do I Love You? by Mike Acker
F. J. Thomas (8/13/2014 2:26:00 PM)
hm...as we learn there are no more smoke and mirrors; I would rather give no surprises nor receive any. A wonderful, and unfortunately all to often true, story you have woven Mike. (Report) Reply
Read this poem in other languages
This poem has not been translated into any other language yet.
I would like to translate this poem »
Mike Acker's Other Poems
Famous Poems
Phenomenal Woman
Maya Angelou
Still I Rise
Maya Angelou
The Road Not Taken
Robert Frost
If You Forget Me
Pablo Neruda
Langston Hughes
Annabel Lee
Edgar Allan Poe
Caged Bird
Maya Angelou
Rudyard Kipling
Stopping By Woods On A Snowy Evening
Robert Frost
A Dream Within A Dream
Edgar Allan Poe

subset: commoncrawl


text:
Comrie's proposal had stricter health guidelines than San Francisco's. In doing so, he declared that "it's important to find a way to make a healthy lifestyle palatable and exciting." Restaurants caught violating the ban, if it were passed in New York City, would face fines ranging between $200 and $2,500. Comrie, a Democrat from Queens and self-described busy parent, says his motivation stems from personal guilt about his unhealthy eating habits and the fact that he has purchased many a Happy Meal for his own kids. Comrie is overweight himself, and hopes the Fast Food Toy Ban Bill will pass, as it did in San Francisco. "I am an example," he said. "If you look at me. I enjoy fast food and unhealthy eating."
McDonald's and the New York State Restaurant Association are likely not to take this battle lightly. "This proposal robs parents of choice while increasing the already burdensome regulation on local restaurant owners," said Andrew Rigie, executive vice president of the New York City Chapter of the New York Restaurant Association, according to a New York Times report. An executive for McDonald's New York region, Mason Smott, said that "taking away toys from kids' meals won't solve childhood obesity." "Our Happy Meals make it easier for families to choose the right foods in portions just for kids," Smoot said. "We provide options for our customers and trust them to make the decisions that are right for their families. Politicians should, too."


text:
Category:Archaeology of Lithuania
From Wikipedia, the free encyclopedia
|Wikimedia Commons has media related to Archaeology in Lithuania.
This category has the following 2 subcategories, out of 2 total.
- ► Archaeological sites in Lithuania (3 C, 4 P)
- ► Prehistory of Lithuania (3 P)
Pages in category "Archaeology of Lithuania"
The following 5 pages are in this category, out of 5 total. This list may not reflect recent changes (learn more).


text:
What is JotForm?
JotForm is a free online form builder which helps you create online forms without writing a single line of code. No sign-up required.
At JotForm, we want to make sure that you're getting the online form builder help that you need. Our friendly customer support team is available 24/7.
We believe that if one user has a question, there could be more users who may have the same question. This is why many of our support forum threads are public and available to be searched and viewed. If you'd like help immediately, feel free to search for a similar question, or submit your question or concern.
My Forms are missingAsked by lisamoore on February 12, 2014 at 10:51 AM
When I click on "My Forms" nothing shows up. It's showing that it works on our published page, but here in jotform, my forms are missing...the screen is blank.
Thank you for contacting us.
Probably some CDN issue. Before logging to Jotform try clearing your browsers cache then try logging in to these links http://jotform.com , http://www.jotformpro.com, http://www.jotform.us
Once logged in view your page in this link https://www.jotform.com/page.php?p=myforms and let us know if this works or not. You can try using a different browser if the issue still persists.


text:
"Darry, you never had a worm, you have a dog named Barry."
"But, Daddy I want a worm!"
"Okay, you can have one, I'll dump some water on the ground and give you a spoon to dig with."
"So I can have a worm?"
"Yes, Darry you can have a worm."
"Can I name him Fido?"
"You can name him whatever you want Darry."
"Can I bring him to school with me?"
"Why not?"
"Worms don't go to school."
"The reading worm does."
"He's a cartoon Darry."
"No...he's real Daddy."
"Okay, he's real."
"Can I bring Fido to school tomorrow?"
"You don't have a worm yet, and how do you know Fido won't be a she?"
"Fido's are boys Daddy."
"But, what if your worm is a she?"
"No, I'll name it Fido so it will be a he and I'm going to teach it Twinkle Twinkle Little Star."
"Good luck with that Darry. Why do you want to teach the worm 'Twinkle Twinkle Little Star'?"
"So that he will become famous, and make lots of money and then..then...we can take the money and give it to kids who don't have food or a school...or mommies or daddies..."
"I'll help you dig up Fido...and we'll teach him 'Twinkle Twinkle Little Star'," I assured Darry as we pulled into our driveway with me thinking a Youtube made when Fido just happened to start singing after Darry's bedtime should work fine.
My favorite book is Arrowsmith by Sinclair Lewis. I really like books and really love my Kindle. I also love the Bible and read a lot of nonfiction. I really liked, "Heaven is for Real," and the "Hunger Games Series."
I like lots of music, an alternative rock band NEEDTOBREATHE is probably my favorite in that their songs move me big time. I also think Cat Stevens, Matchbox Twenty, Susan Boyle, I'm pretty divers and includes Christian bands.
Not big on these. I like Pixar movies though. I do really like the John Adams HBO Miniseries produced by Tom Hanks. My recent favorite is The King's Speech.
2)My glasses
5)My Laptop
(So 2 and 4 should be switched..but I am too lazy.)
I would really truly like to find someone special to enjoy life with each of us being a blessing in one another's life. People are what make life worth living and a companion to share the wonder and adventure that life is makes it all the more better. I don't want my life to be overcome by money or material things, focus upon which can deteriorate a relationships, but on people and all of beauty around us if we just stopped and look. I want someone who is willing to stop, and see that beauty with me.


text:
+ Locations, Office Hours & Directions
Health care leader whose mission is to keep you healthy. Under-one-roof convenience, 24-hour advice nurse, and online access to manage your health - anytime.
We invite you to write a review about your experience with Dr. Nguyen.
Yes, Dr. Chau D. Nguyen is accepting new patients at this office.
9333 Imperial Highway, Downey, CA 90242
|Doctor Specialty
|Accepting New Patients?
|Languages Spoken
|111 See them all
|Doctor's Specialty
|Doctor's Title
|Accepting New Patients?
Don't have an account? Sign up now to continue booking your visit:
Don't have an account? Sign up now to continue booking your visit:
Please contact the doctor's office to inquire about insurance.
Dr. Nguyen has one office in California where she specializes in Anesthesiology.
Dr. Nguyen works with one hundred and ten doctors including Dr. Vuong Ta and Dr. Caroline King.
As an anesthesiologist in Downey, CA, Dr. Nguyen ensures patients are free of pain before (pre-op), during, and after (post-op) a surgical procedure. By administering anesthesia, Dr. Nguyen ensures that patients do not feel the pain of a surgical procedure.
Read the most recent articles about Anesthesiology
See our Privacy Policy and Terms of Use.


text:
CB Bain | BASIC FORECLOSURE LAWS IN THE STATE OF WA | 2013 | AGC Lake Union
- CBBain Training & Education Team
Tuesday, March 5, 2013 from 10:00 AM to 2:00 PM (PST)
Basic Foreclosures Laws in the State of Washington
Updated class for 2013
4 Free Clock Hours!
Presented by: McFerran University
Instructor: Ed McFerran - McFerran, Burns
This is the 2013 version of our basic foreclosure class for real estate professionals. Understand the basic lasws for foreclosure including credit and tax consequences to the consumer.
This class is updated to reflect law changes effective June 7, 2012 to foreclosures in the State of Washington.
**Please bring your lunch for a working lunch.
Please Note:
Our classes & events are exclusive to CB Bain, brokers, staff, and guests by special invitation.
Join millions of people on Eventbrite.
In order to purchase these tickets in installments, you'll need an Eventbrite account. Log in or sign up for a free account to continue.


text:
No products
₹ 14,999 Décathlon
Adults who are looking for city commute, occasional mountain bike and sport touring. Front suspensions give you added comfort.
The first true touring mountain bike: comfortable thanks to a more upright seating position and front suspension. A lightweight aluminium frame and Shimano tourney 21 speeds.
Good quality. A little costly but worth it. Can we lighter for an aluminum frame.
It is good one with riding comfort
I had been using for 4 months. I travelled more than 300 km .good one.price of worth
An awesome bike with 21 speed shimano grip shift.It is awesome but the pedal of the bike has many solpokes which they poke sometimes if we ride wearing shorts.And it stucks sometimes while riding. The look is Awesome and has many colour ranges and it's a cool product.But we need to have to adjust spare parts in Decathlon itself like Stands, Mudguards,Led etc.But good and worth for money.
I felt dissapointed when i saw my chain cover comingout.after that that whole chain cover came out.can any one help me to find that chain cover.the chain cover is poor.otherthan that everything is okay.please help me for finding the chain cover
I purchase this cycle past three month before so fare i ride more then 600km. i recommend this cycle for others saddle should be improve while i riding i feel not a comfort to ride more km and the when change the gear to 3*7 i hear some noice in chain otherwise its a best one to buy.. To be honest its a Beast
Best one for this price
poor saddle
I purchased it on last week and till today its performance is very good. I can recommend the same to others.
Team, please guide me regarding the free check up of my new bike.


text:
Promotional price valid on web orders only. Your contract pricing may differ. Interested in signing up for a dedicated account number?
Learn More
Learn More
Eppendorf Scientific Shaker Universal Platforms
For use with New Brunswick Innova, I-Series and Excella Shakers
Manufacturer: Eppendorf M13249904
Requires : Clamps (sold separately)
Specifications Description & Specifications
|Innova I26/I-26R shaker
|18 in.
|Pre-drilled holes
|30 in.
|30 in.
|Universal platform
|18 x 30 in. (457 x 762mm)
|18 in.
Provide Content Correction
We continue to work to improve your shopping experience and your feedback regarding this content is very important to us. Please use the form below to provide feedback related to the content on this product.
Product Title
Thank You!
Your feedback has been submitted. Fisher Scientific is always working to improve our content for you. We appreciate your feedback.Ok


text:
DISCREET BILLING & PACKAGING, WORLDWIDE SHIPPING - 100% Satisfaction
Art with a great taste!
The easy squeeze pens are no mess just squeeze and apply where you want them. The pens have two delicious flavors dark chocolate and milk chocolate. Write your most intimate secret desires on your favorite part of your lovers body when you use Chocolate Play Pens 2-Pack. Let the fun begin when you write a message and then lick it all off! These tasty chocolate pens take foreplay to a whole new level.
Chocolate Play Pens 2-Pack
Includes: one milk chocolate pen and one dark chocolate pen
Ingredients: Glucose syrup, water, sugar, citric acid, acidity regulator:sodium citrate, thickener: xanthan gum, artificial flavors, potassium sorbate, artificial color: yellow 5, red 40, blue 1, plain caramel, titanium dioxide.
Many customers combine Chocolate Play Pens with Edible CANDY products for even more enjoyable sex.
HOTT Products Chocolate Play Pens now available across all cities India, Free International Shipping + Discreet White Bubble wrap Packaging + Pay in Rupees via 5 Payment Options = 1000's of happy & satisfied customers in India
Need help with size/fitting? We have a beautiful size guide specially designed for you to identify your size and place the most accurate order. For Bra sizing (click here) For Lingerie fitting & style (click here) For all legwear (click here). We are also able to advise if you have questions about size and fitting.
If you are not completely satisfied with this product, simply let us know within 15days of receipt of the product by submitting a return request Request Return. We will issue an RMA# and arrange for our delivery team to get it picked up. Depending on the reason for return (color/size changes or defective product etc) and your instructions, we will process the exchange/return/refund within 48hrs of receipts of the authorized returns. Note: Some products cannot be returned for hygienic reasons, pls (click here) for detailed return policy.
We ship your order from our distribution center in US. It generaly takes about 10-14days for them to arrive after clearing customs. (click here) to see how it works. We take care of customs & duty and all taxes as the price is all inclusive. You just have to pay a very low charge for express air shipping, which is charged by FEDEX/UPS at a heavily discounted rate. Shipping is FREE on orders over Rs10,000.
Click our Pin Code Checker to see if your Pin Code is servicable.