2009
DOI: 10.1007/978-3-642-01307-2_53
|View full text |Cite
|
Sign up to set email alerts
|

Scalable Web Mining with Newistic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
3
0
1

Year Published

2010
2010
2011
2011

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 12 publications
0
3
0
1
Order By: Relevance
“…For example, consider cluster 3 which has the following matrices: (21) The largest eigenvalue of (21) is 0.9635 and the corresponding right eigenvector is . The price perturbation vector for cluster 3 is found from (15) to be …”
Section: A Seven-bus Examplementioning
confidence: 99%
See 1 more Smart Citation
“…For example, consider cluster 3 which has the following matrices: (21) The largest eigenvalue of (21) is 0.9635 and the corresponding right eigenvector is . The price perturbation vector for cluster 3 is found from (15) to be …”
Section: A Seven-bus Examplementioning
confidence: 99%
“…The process then iterates until all points belong to a cluster. The QT algorithm is computationally intensive, [21], as it requires a distance metric to be computed between all points.…”
Section: A Quality Threshold Algorithmmentioning
confidence: 99%
“…El crawling se utiliza frecuentemente en algunas tareas de PLN como en (Younus et al, 2011;Dan y Mocian, 2009y Wang, Lu y Chen, 2009). El bot o web crawler, dado un punto de partida marcado por los profesores, navega a través de los diferentes enlaces de un sitio web para acceder al correspondiente contenido.…”
Section: ) Recopilación De Noticiasunclassified
“…[3] describes very briefly the anatomy of a news search engine. Newistic [4] is a recently emerged system crawling and mining news articles on the Web but the paper dose not give much details.…”
Section: Related Workmentioning
confidence: 99%