Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Alex Penev

dblp:11/5103 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 8 · 5 first-authorArtificial intelligence and machine learning · 6 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 67% Web and social media mining · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
similarity search
0.112008
Finding similar pages in a social tagging repository · WWW 2008
Web and social media mining
social tagging
0.112008
Finding similar pages in a social tagging repository · WWW 2008
Information retrieval › similarity measure
web page similarity
0.112008
Finding similar pages in a social tagging repository · WWW 2008

Methods — techniques the papers use, named apart from their topics

cosine similarity · 0.1
YearPublicationVenuePosition
2010 Structure vs. content in hierarchical corpora
Alex Penev, Raymond K. Wong 0001
Inf. Retr.1
2009 Framework for timely and accurate ads on mobile devices
abstract
We propose a framework for mobile advertising covering Value-Added Services where an ad-database is maintained on the device and both selection and display are dictated by the device. Advantages over existing mobile marketing are that ads are more timely, viable on a variety of use cases, can be both location-sensitive and personalized with minimal privacy concerns, and provide an obvious means for subsidizing users' service costs. We construct a suitable selection algorithm and evaluate its execution, accuracy and scalability. We show that ad-serving can be done under the processing constraints imposed by mobiles, which may lead to improvements in mobile marketing effectiveness.
Alex Penev, Raymond K. Wong 0001
CIKM1
2008 Grouping Categorical Anomalies
abstract
We present an approach for discovery of groups of unusual data points that are anomalous for similar reasons. This differs from clustering in that the points that are grouped may be quite 'distant' and can use categorical attributes, and differs from anomaly detection in that we are not looking for individual outliers.
Matthew Gebski, Alex Penev, Raymond K. Wong 0001
Web Intelligence2
2008 TagScore: Approximate Similarity Using Tag Synopses
abstract
Collaborative tagging is the aggregate effort by a community of online users to annotate web content with metadata labels called tags. It is a simple activity that enriches our knowledge about digital content, and has gained popularity with services such as Del.icio.us. Del.icio.us has a large repository that evolves daily, presenting interesting new problems for IR. We present TagScore, a scoring function to rate the goodness of Del.icio.us tags for their associated web page. It gives us a succinct synopsis for a page that we can use to efficiently find similar pages. Using real Del.icio.us data, we show that our approach gives good correlation to cosine similarity but is several hundred times faster and requires minimal storage overhead.
Alex Penev, Raymond K. Wong 0001
Web Intelligence1
2008 Finding similar pages in a social tagging repository
abstract
Social tagging describes a community of users labeling web content with tags. It is a simple activity that enriches our knowledge about resources on the web. For a computer to help users search the tagged repository, it must know when tags are good or bad. We describe TagScore, a scoring function that rates the goodness of tags. The tags and their ratings give us a succinct synopsis for a page. We `find similar' pages in Del.icio.us by comparing synopses. Our approach gives good correlation to the full cosine similarity but is hundreds of times faster.
Alex Penev, Raymond K. Wong 0001
WWW1
2006 Classification of Hidden Network Streams
Matthew Gebski, Alex Penev, Raymond K. Wong 0001
DaWaK2
2006 Topic Distillation in Desktop Search
Alex Penev, Matthew Gebski, Raymond K. Wong 0001
DEXA1
2006 Protocol Identification of Encrypted Network Traffic
abstract
New means of communication are constantly emerging, some of which may constitute resource misuse of an organisation's network system. Identifying the protocols used is straight-forward when inspecting network logs, but we focus on the problem of identifying the underlying protocol present in an unknown TCP connection. Actions are difficult to detect if the underlying protocol is encrypted and tunneled through a proxy server or SSH. We use a graph-comparison approach to build profiles of several protocols, and attempt to classify an unknown, encrypted protocol against these profiles using only the visible behaviour of the protocol being tunneled - the size, timing and direction of packets
Matthew Gebski, Alex Penev, Raymond K. Wong 0001
Web Intelligence2