Unsupervised Streaming Feature Selection in Social Media
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The explosive growth of social media sites brings about massive amounts of high-dimensional data. Feature selection is effective in preparing high-dimensional data for data analytics. The characteristics of social media present novel challenges for feature selection. First, social media data is not fully structured and its features are usually not predefined, but are generated dynamically. For example, in Twitter, slang words (features) are created everyday and quickly become popular within a short period of time. It is hard to directly apply traditional batch-mode feature selection methods to find such features. Second, given the nature of social media, label information is costly to collect. It exacerbates the problem of feature selection without knowing feature relevance. On the other hand, opportunities are also unequivocally present with additional data sources; for example, link information is ubiquitous in social media and could be helpful in selecting relevant features. In this paper, we study a novel problem to conduct unsupervised streaming feature selection for social media data. We investigate how to exploit link information in streaming feature selection, resulting in a novel unsupervised streaming feature selection framework USFS. Experimental results on two real-world social media datasets show the effectiveness and efficiency of the proposed framework comparing with the state-of-the-art unsupervised feature selection algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954 · cited 1×
“struction [4, 15, 23].”
Theoretical and Empirical Analysis of ReliefF and RReliefF
Robnik-Šikonja, M., & Kononenko, I. (2003) · Machine Learning · doi:10.1023/a:1025667309714 · Cited by 3,025 · cited 1×
“Filter methods are independent of any learning algorithms and are thereby very efficient, they rely on some data characteristics such as distance, consistency, dependency, information, and correlation to measure the strength of each feature individually [13, 16, 25, 28].”
BackgroundRelational learning via latent social dimensions
Tang, L., & Liu, H. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557109 · Cited by 799 · cited 1×
“Uncovering hidden social factors has been extensively studied [2, 22, 30].”
BackgroundSelf-citation
Cited by
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
“For the feature selection problems with streaming features, the number of instances is considered to be constant while candidate features arrive one at a time; the task is to timely select a subset of relevant features from all features seen so far (Perkins and Theiler 2003; Zhou et al. 2005; Wu et al. 2010; Yu et al.…”
BackgroundMethodInfluentialSelf-citationFeature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Treviño, R. P., Tang, J., & Liu, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07996 · Cited by 739
Self-citationDeep Anomaly Detection on Attributed Networks
Ding, K., Li, J., Bhanushali, R., & Liu, H. (2019) · Proceedings of the 2019 SIAM International Conference on Data Mining · doi:10.1137/1.9781611975673.67 · Cited by 548
Self-citationLabel Informed Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018667 · Cited by 487
Self-citationRecent advances in feature selection and its applications
Li, Y., Li, T., & Liu, H. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-017-1059-8 · Cited by 400
“On the other hand, to address some issues, such as the dynamic feature generation, high label cost and the utilization of ubiquitous link information in social media, the unsupervised online feature selection framework—USFS—is proposed and applied into social media in [100].”
BackgroundSelf-citation
Metadata
- Authors
- Li, J., Hu, X., Tang, J., & Liu, H.
- Venue
- Proceedings of the 24th ACM International on Conference on Information and Knowledge Management
- Publisher
- ACM
- Published
- 2015-10-17
- Pages
- 1041-1050
- OpenAlex
- W1998029376
- Cited by
- 114
- References
- 4
- FWCI
- 4.02
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unsupervised Streaming Feature Selection in Social Media. https://app.cochat.ai/papers/10.1145/2806416.2806501
- The paper
- Li, J., Hu, X., Tang, J., & Liu, H. (2015). Unsupervised Streaming Feature Selection in Social Media. Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. https://doi.org/10.1145/2806416.2806501
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.