2021
DOI: 10.1109/access.2021.3103319
|View full text |Cite
|
Sign up to set email alerts
|

An Unsupervised Model for Identifying and Characterizing Dark Web Forums

Abstract: Dark Web forums are significantly exploited to trade confidential information and illicit products by criminals. This paper addresses the problem of how to identify the cluster of discussion forums and their characteristics on the Dark Web. Exiting methods are mostly dependent on the continuous labeled contents, which are expensive and not feasible due to the nature of Dark Web data. Therefore, an approach that does not need a continuous availability of labeled forum and related knowledge is required. To this … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
0
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 41 publications
(40 reference statements)
0
0
0
Order By: Relevance
“…At the end of cycle, the inventory completed a most elevated quantity of deficiency S and once that brand new request is placed to zero-in the excess [16] [17]. The adjustment in inventory degree I (t) as for point eventually is as given: d/dt I = − a + bt , 0 ≤ t ≤ μ h (22) d/dt I + θ t I t = − a + bt , μ h ≤ t ≤ t (23) In this section, the objective is to create probably the most excellent estimations of T as well as t1 that limit Z (T, t1). For a foreordained estimation of T, taking second and ist request subsidiaries of Z (T, t1) regarding t1,…”
Section: F Formulation Of Retailer's Cost Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…At the end of cycle, the inventory completed a most elevated quantity of deficiency S and once that brand new request is placed to zero-in the excess [16] [17]. The adjustment in inventory degree I (t) as for point eventually is as given: d/dt I = − a + bt , 0 ≤ t ≤ μ h (22) d/dt I + θ t I t = − a + bt , μ h ≤ t ≤ t (23) In this section, the objective is to create probably the most excellent estimations of T as well as t1 that limit Z (T, t1). For a foreordained estimation of T, taking second and ist request subsidiaries of Z (T, t1) regarding t1,…”
Section: F Formulation Of Retailer's Cost Modelmentioning
confidence: 99%
“…A linear regression coefficient over this time period [21] shows how the company's approach has changed. Next, hospitals will be grouped hierarchically [22]. First, second, and third clusters contain medical facilities in order (5,6,7,9,10,11).…”
Section: Table V the Use Of A Trend-based Clustering System To A Comp...mentioning
confidence: 99%
“…Additional approaches include employing term extraction methods such as TF-IDF and bag of words (BOW), where classification was conducted using naive Bayes (NB), support vector machines (SVM), and linear regression (LR) [1,17]. Another research focused on classifying marketplace attributes via group clustering and decision trees (DT) [18]. There have been endeavors to detect the Dark Web using edge computing and feature weighting [19], and to generate software quality metrics for classifying Dark Web characteristics [20].…”
Section: A Dark Web Analysismentioning
confidence: 99%
“…Additional research classified Dark Web forums by integrating TF-IDF, random projection, and PCA [42], extracting features according to class, and applying machine learning [43]. This study also employed TF-IDF for feature extraction and executed classification using Kmeans and DT [18]. Numerous analyses of the Dark Web have been conducted using word2vec [44], and there is active research on transforming extracted text features into matrices via embedding and implementing deep learning [45,46].…”
Section: Text Classificationmentioning
confidence: 99%
See 1 more Smart Citation