Loading…
Login
Scholar Register
Business Register
Subscribe
Loading…
Article Title
Abstract
Keyword
Category
MESH Heading
Grant Agency
RCAID
DOI
PMID
PMCID
Author
Affiliation
Email
Journal Title
ISSN
Publisher
Loading…
Contains
Equals
Find an Article
Find an Article (55625001)
Find a Category (125)
Find a Journal (6168)
Find a Scholar (4145)
Find an Academic Assistant (18)
Find an Article PDF (4634701)
Today's Articles (2235)
Subscriber (49994)
Citation(s) in
RCA
8
(from Reference Citation Analysis)
Indexed Articles
Today (0)
Yesterday (0)
This Week (0)
Last Week (0)
Current Month (0)
Last Month (0)
Ranked By
Impact Index Per Article
Citation(s) in
RCA
Results Analysis
Year Published Analysis
Article Type Analysis
Journal Title Analysis
Category Analysis
Results Analysis
Year Published
2018 (1)
2017 (1)
2016 (1)
2015 (3)
2014 (1)
2013 (1)
Show more
Refine
Article Statistics
RCA (8)
SCIE (7)
ESCI (1)
Refine
Publication Titles
DATA MINING AND KNOWLEDGE DISCOVERY (3)
KNOWLEDGE AND INFORMATION SYSTEMS (3)
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS (1)
SOCIAL NETWORK ANALYSIS AND MINING (1)
Show more
Refine
Category
Computer Science, Information Systems (7)
Computer Science, Artificial Intelligence (6)
Statistics & Probability (1)
Show more
Refine
For:
Liu G
, Wong L.
Effective Pruning Techniques for Mining Quasi-Cliques.
Machine Learning and Knowledge Discovery in Databases
. [DOI:
10.1007/978-3-540-87481-2_3
]
[
Citation(s) in
RCA
: 53
]
[
Impact Index Per Article: 3.3
]
[
Reference Citation Analysis
]
[
What about the content of this article? (
0
)
]
[
Track Full Text
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 12/12/2022]
Number
Cited by Other Article(s)
1
Conde-Cespedes P
, Ngonmang B, Viennet E. An efficient method for mining the maximal α-quasi-clique-community of a given node in complex networks.
SOCIAL NETWORK ANALYSIS AND MINING
2018. [DOI:
10.1007/s13278-018-0497-y
]
[
Citation(s) in
RCA
: 0
]
[
Impact Index Per Article: 0
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 10/17/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
2
Micro-review synthesis for multi-entity summarization.
Data Min Knowl Discov
2017. [DOI:
10.1007/s10618-017-0491-4
]
[
Citation(s) in
RCA
: 0
]
[
Impact Index Per Article: 0
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 10/20/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
3
Boden B
, Günnemann S, Hoffmann H, Seidl T. MiMAG: mining coherent subgraphs in multi-layer graphs with edge labels.
Knowl Inf Syst
2016. [DOI:
10.1007/s10115-016-0949-5
]
[
Citation(s) in
RCA
: 9
]
[
Impact Index Per Article: 1.1
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 11/28/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
4
Zhang J
, Chen Y. Monte Carlo Algorithms for Identifying Densely Connected Subgraphs.
J Comput Graph Stat
2015. [DOI:
10.1080/10618600.2014.930040
]
[
Citation(s) in
RCA
: 0
]
[
Impact Index Per Article: 0
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 10/25/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
5
Gao M
, Lim EP, Lo D, Prasetyo PK. On detecting maximal quasi antagonistic communities in signed graphs.
Data Min Knowl Discov
2015. [DOI:
10.1007/s10618-015-0405-2
]
[
Citation(s) in
RCA
: 4
]
[
Impact Index Per Article: 0.4
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 11/29/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
6
Kostakis O
, Papapetrou P. Finding the longest common sub-pattern in sequences of temporal intervals.
Data Min Knowl Discov
2015. [DOI:
10.1007/s10618-015-0404-3
]
[
Citation(s) in
RCA
: 9
]
[
Impact Index Per Article: 1.0
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 11/28/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
7
Finding maximal homogeneous clique sets.
Knowl Inf Syst
2014. [DOI:
10.1007/s10115-013-0625-y
]
[
Citation(s) in
RCA
: 4
]
[
Impact Index Per Article: 0.4
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 11/24/2022]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
8
Günnemann S
, Färber I, Boden B, Seidl T. GAMer: a synthesis of subspace clustering and dense subgraph mining.
Knowl Inf Syst
2013. [DOI:
10.1007/s10115-013-0640-z
]
[
Citation(s) in
RCA
: 17
]
[
Impact Index Per Article: 1.5
]
[
Reference Citation Analysis
]
[
Track Full Text
]
[
Journal Information
]
[
Subscribe
]
[
Scholar Register
]
[Indexed: 01/11/2023]
Abstract
Collapse
Key Words
Collapse
MESH Headings
Collapse
Grants
Collapse
Affiliation(s)
Collapse
Page 1 of 1
1
Loading…
Loading…
Export Articles to File
Export Citation Analysis
Export Citation Analysis
Article Number From
to
A maximum of 600 records can be exported at a time.
Format:
*
Excel
Plain Text
PDF
WORD
Invalid value
Loading…
Click to Download the Exported File
Loading…
Loading…
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA
Select the Category
Loading…
Loading…
Impact Index Per Article
Calculation for Impact Index Per Article
Times Cited ÷ Number of Years = Impact Index Per Article
TM
Loading…
