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.
? Tutorial for this page

Dan Luo 0001

dblp:03/142-1 · DBLP profile ↗
← Back
13ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · conflict

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

Artificial intelligence and machine learning · 9 · 1 first-authorDatabases, data management, data science and information retrieval · 5Human-computer interaction and ubiquitous computing · 1

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
2 papers
Information retrieval · 67% Data mining · 26% Data integration and cleaning · 8%

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

TopicWeightPapersLastEvidence papers
Data mining › knowledge discovery process
actionable knowledge discovery
0.112010
Flexible Frameworks for Actionable Knowledge Discovery · IEEE Trans. Knowl. Data Eng. 2010
Information retrieval › similarity search › nearest neighbor search
approximate nearest neighbor search
0.112009
A Cost-Effective LSH Filter for Fast Pairwise Mining · ICDM 2009
Information retrieval › hashing › hashing for nearest neighbor search
locality-sensitive hashing
0.112009
A Cost-Effective LSH Filter for Fast Pairwise Mining · ICDM 2009
Information retrieval
similarity search
0.112009
A Cost-Effective LSH Filter for Fast Pairwise Mining · ICDM 2009

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

integer programming · 0.1case study · 0.1locality-sensitive hashing · 0.1
YearPublicationVenuePosition
2011 Agent-Based Subspace Clustering
Yanchang Zhao, Dan Luo 0001, Chengqi Zhang
PAKDD (2)3
2011 Combined Mining: Discovering Informative Knowledge in Complex Data
abstract
Enterprise data mining applications often involve complex data such as multiple large heterogeneous data sources, user preferences, and business impact. In such situations, a single method or one-step mining is often limited in discovering informative knowledge. It would also be very time and space consuming, if not impossible, to join relevant large data sources for mining patterns consisting of multiple aspects of information. It is crucial to develop effective approaches for mining patterns combining necessary information from multiple relevant business lines, catering for real business settings and decision-making actions rather than just providing a single line of patterns. The recent years have seen increasing efforts on mining more informative patterns, e.g., integrating frequent pattern mining with classifications to generate frequent pattern-based classifiers. Rather than presenting a specific algorithm, this paper builds on our existing works and proposes combined mining as a general approach to mining for informative patterns combining components from either multiple data sets or multiple features or by multiple methods on demand. We summarize general frameworks, paradigms, and basic processes for multifeature combined mining, multisource combined mining, and multimethod combined mining. Novel types of combined patterns, such as incremental cluster patterns, can result from such frameworks, which cannot be directly produced by the existing methods. A set of real-world case studies has been conducted to test the frameworks, with some of them briefed in this paper. They identify combined patterns for informing government debt prevention and improving government service objectives, which show the flexibility and instantiation capability of combined mining in discovering informative knowledge in complex data.
Longbing Cao, Huaifeng Zhang, Yanchang Zhao, Dan Luo 0001, Chengqi Zhang
IEEE Trans. Syst. Man Cybern. Part B4
2010 Flexible Frameworks for Actionable Knowledge Discovery
abstract
Most data mining algorithms and tools stop at the mining and delivery of patterns satisfying expected technical interestingness. There are often many patterns mined but business people either are not interested in them or do not know what follow-up actions to take to support their business decisions. This issue has seriously affected the widespread employment of advanced data mining techniques in greatly promoting enterprise operational quality and productivity. In this paper, we present a formal view of actionable knowledge discovery (AKD) from the system and decision-making perspectives. AKD is a closed optimization problem-solving process from problem definition, framework/model design to actionable pattern discovery, and is designed to deliver operable business rules that can be seamlessly associated or integrated with business processes and systems. To support such processes, we correspondingly propose, formalize, and illustrate four types of generic AKD frameworks: Postanalysis-based AKD, Unified-Interestingness-based AKD, Combined-Mining-based AKD, and Multisource Combined-Mining-based AKD (MSCM-AKD). A real-life case study of MSCM-based AKD is demonstrated to extract debt prevention patterns from social security data. Substantial experiments show that the proposed frameworks are sufficiently general, flexible, and practical to tackle many complex problems and applications by extracting actionable deliverables for instant decision making.
Longbing Cao, Yanchang Zhao, Huaifeng Zhang, Dan Luo 0001, Chengqi Zhang, Eun K. Park
IEEE Trans. Knowl. Data Eng.4
2009 A Cost-Effective LSH Filter for Fast Pairwise Mining
abstract
The pairwise mining problem is to discover pairwise objects having measures greater than the user-specified minimum threshold from a collection of objects. It is essential in a large variety of database and data-mining applications. Of late, there has been increasing interest in applying a Locality-Sensitive Hashing (LSH) scheme for pairwise mining. LSH-type methods have shown themselves to be simply implementable and capable of achieving significant performance gain in running time over most exact methods. However, the present LSH-type methods still suffer from some bottlenecks, such as ¿the curse of threshold¿. In this paper, we proposed a novel LSH-based method, namely Cost-effective LSH filter (Ce-LSH for short), for pairwise mining. Compared with previous LSH-type methods, it uses a lower fixed number of LSH functions and is thus more cost-effective. Substantial experiments evidence that our method gives significant improvement in running time over existing LSH-type methods and some recently reported method based on upper-bound. Experimental results also indicate that it scales well even for a relatively low minimum threshold and for a fairly small miss ratio.
Yun Xiong, Longbing Cao, Dan Luo 0001, Xuchun Su, Yangyong Zhu
ICDM4
2008 Agent Collaboration for Multiple Trading Strategy Integration
Longbing Cao, Dan Luo 0001, Yanshan Xiao, Zhigang Zheng
KES-AMSTA2
2008 Multi-agent System for Custom Relationship Management with SVMs Tool
Yanshan Xiao, Bo Liu 0002, Dan Luo 0001, Longbing Cao
KES-AMSTA3
2007 Building Agent Service Oriented Multi-Agent Systems
Dan Luo 0001, Longbing Cao, Jiarui Ni, Li Liu 0033
KES-AMSTA1
2006 Ontological Engineering in Data Warehousing
Longbing Cao, Jiarui Ni, Dan Luo 0001
APWeb3
2006 Fuzzy Genetic Algorithms for Pairs Mining
Longbing Cao, Dan Luo 0001, Chengqi Zhang
PRICAI2
2004 Integrative Early Requirements Analysis for Agent-Based Systems
abstract
Early requirements analysis (ERA) is quite significant for building agent-based systems. Goal-oriented requirements analysis is promising for the agent-oriented early requirements analysis. In general, either visual modeling or formal specifications is used for the ERA. This way cannot capture requirements precisely and completely. We present an integrative modeling framework for agent-oriented early requirements analysis; this framework implements goal-oriented requirement analysis. The integrative modeling combines visual modeling and formal modeling together. Extended i* framework is used for building visual models; formal specifications complement the visual modeling to define and refine requirements. Both visual and formal models are outlined through a practical agent-based system F-TRADE. The integrative modelling seems to model early requirements comprehensively and concretely, and benefit refinement and conflict management in building agent systems.
Longbing Cao, Chengqi Zhang, Dan Luo 0001, Neda Zamani
HIS3
2004 Ontology Services-Based Information Integration in Mining Telecom Business Intelligence
Longbing Cao, Dan Luo 0001, Li Liu 0033
PRICAI3
2004 Integration of Business Intelligence Based on Three-Level Ontology Services
abstract
Usually, integration of business intelligence (BI) from realistic telecom enterprise is by packing data warehouse (DW), OLAP, data mining and reporting from different vendors together. As a result, BI system users are transferred to a reporting system with reports, data models, dimensions and measures predefined by system designers. As a result of survey, 85% of DW projects failed to meet their intended objectives. In this paper, we investigate how to integrate BI packages into an adaptive and flexible knowledge portal by constructing an internal link and communication channel from top-level business concepts to underlying enterprise information systems (EIS). An approach of three-level ontology services is developed, which implements unified naming, directory and transport of ontology services, and ontology mapping and query parsing among conceptual view, analytical view and physical view from user interfaces through DW to EIS. Experiments on top of real telecom EIS shows that our solution for integrating BI presents much stronger power to support operational decision making more user-friendly and adaptively compared with those simply combining BI products presently available together.
Longbing Cao, Dan Luo 0001, Chengqi Zhang
Web Intelligence3
2003 Systematic Engineering in Designing Architecture of Telecommunications Business Intelligence System
Longbing Cao, Dan Luo 0001, Chengqi Zhang
HIS2