An Automated Real-Time System for Opinion Mining using a Hybrid Approach
Bibliographic record
Abstract
In this paper, a novel idea is being presented to perform Opinion Min ing in a very simp le and efficient manner with the help of the One-Level-Tree (OLT) based approach. To recognize opinions specific for features in customer reviews having a variety of features commingled with diverse emotions. Unlike some previous ventures entirely using one-time structured or filtered data but this is solely based on unstructured data obtained in real-t ime fro m Twitter. The hybrid approach utilizes the associations defined in Dependency Parsing Grammar and fu lly emp loys Double Propagation to extract new features and related new opinions within the review. The Dictionary based approach is used to expand the Opinion Lexicon. W ithin the dependency parsing relations a new relat ion is being proposed to more effectively catch the associations between opinions and features. The three new methods are being proposed, termed as Double Pos itive Double Negative (DPDN), Catch-Phrase Method (CPM) & Negation Check (NC), for perfo rming criteria specific evaluations. The OLT approach conveniently displays the relationship between the features and their opinions in an elementary fashion in the form of a graph. The proposed system achieves splendid accuracy across all do mains and also performs better than the state-of-the-art systems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.006 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".